Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
DOI10.1007/s10898-019-00835-5zbMath1472.90082OpenAlexW2978129353MaRDI QIDQ2301183
Thi Ngan Nguyen, Van-Bong Nguyen, Ruey-Lin Sheu
Publication date: 28 February 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00835-5
quadratically constrained quadratic programmingSlater conditionjoint numerical range\(S\)-lemmaCDT problemmatrix rank-one decomposition procedure
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Numerical methods of relaxation type (49M20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The generalized trust region subproblem
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- On the indefinite quadratic fractional optimization with two quadratic constraints
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- On the spherical quasi-convexity of quadratic functions
- Some results for quadratic problems with one or two quadratic constraints
- Convexity of quadratic transformations and its use in control and optimization
- Recent advances in trust region algorithms
- Solving Generalized CDT Problems via Two-Parameter Eigenvalues
- A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
- On the Field of Values of a Matrix
- Computing a Trust Region Step
- Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
- Quadratically constrained quadratic programming: Some applications and a method for solution
- Solving the Trust-Region Subproblem using the Lanczos Method
- Semidefinite Programming
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- On Cones of Nonnegative Quadratic Functions
- On the Sequential Quadratically Constrained Quadratic Programming Methods
- A Survey of the S-Lemma
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming
This page was built for publication: Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
