A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
From MaRDI portal
Publication:2928411
zbMath1327.90168arXiv1312.1400MaRDI QIDQ2928411
Yong Hsia, Ruey-Lin Sheu, Gang-Xuan Lin
Publication date: 7 November 2014
Full work available at URL: https://arxiv.org/abs/1312.1400
matrix pencilSlater conditionhidden convexityquadratically constrained quadratic programsimultaneously diagonalizable with congruenceunattainable SDP
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (14)
Geometric properties for level sets of quadratic functions ⋮ SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices ⋮ An efficient algorithm for solving the generalized trust region subproblem ⋮ Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems ⋮ On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ Linear pencils and quadratic programming problems with a quadratic constraint ⋮ Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint ⋮ Solving the Problem of Simultaneous Diagonalization of Complex Symmetric Matrices via Congruence ⋮ Strong duality for generalized trust region subproblem: S-lemma with interval bounds ⋮ Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming ⋮ Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ S-lemma with equality and its applications
This page was built for publication: A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil
