| Full text | |
| Author(s): |
Armijo, Nicolas F.
;
Gomez, Walter
;
Concha, Juan P.
Total Authors: 3
|
| Document type: | Journal article |
| Source: | OPTIMIZATION; v. N/A, p. 26-pg., 2022-07-01. |
| Abstract | |
In this work, we study the so-called extended Celis-Dennis-Tapia subproblem that are classical trust region subproblems with an additional quadratic constraint. For this class of problems, we propose a family of relaxations, and study some of its key properties, for instance, convexity issues, exactness of the relaxation, sufficient condition for exactness. The relaxation proposed is obtained adapting to our case a methodology recently developed for trust region problems with an additional conic constraint. We also find sufficient conditions for exactness of the proposed relaxation and discuss the relations between them. Finally, some numerical experiments are presented for testing the proposed relaxation and the sufficient conditions for its tightness. (AU) | |
| FAPESP's process: | 20/07421-5 - Practical algorithms for continuous optimization |
| Grantee: | Gabriel Haeser |
| Support Opportunities: | Regular Research Grants |
| FAPESP's process: | 19/13096-2 - Complementarity measures in optimality conditions |
| Grantee: | Nicolas Esteban Fuentealba Armijo |
| Support Opportunities: | Scholarships in Brazil - Doctorate (Direct) |