Pages that link to "Item:Q2928411"
From MaRDI portal
The following pages link to A Revisit to Quadratic Programming with One Inequality Quadratic Constraint via Matrix Pencil (Q2928411):
Displayed 14 items.
- S-lemma with equality and its applications (Q263215) (← links)
- Strong duality for generalized trust region subproblem: S-lemma with interval bounds (Q497446) (← links)
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices (Q1646573) (← links)
- An efficient algorithm for solving the generalized trust region subproblem (Q1655384) (← links)
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint (Q1717222) (← links)
- Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere (Q2301183) (← links)
- Geometric properties for level sets of quadratic functions (Q2633540) (← links)
- Linear pencils and quadratic programming problems with a quadratic constraint (Q2693699) (← links)
- On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint (Q5107288) (← links)
- Solving the Problem of Simultaneous Diagonalization of Complex Symmetric Matrices via Congruence (Q5146624) (← links)
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem (Q5231678) (← links)
- Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming (Q5964247) (← links)
- Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems (Q6087885) (← links)
- On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem (Q6092945) (← links)