On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)

Related Items

A partial ellipsoidal approximation scheme for nonconvex homogeneous quadratic optimization with quadratic constraints ⋮ Linear Programming on the Stiefel Manifold

Uses Software

GQTPAR

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Local nonglobal minima for solving large-scale extended trust-region subproblems
On KKT points of Celis-Dennis-Tapia subproblem
On a subproblem of trust region algorithms for constrained optimization
Linear and nonlinear programming.
A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
Least squares with a quadratic constraint
A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
Convexity of quadratic transformations and its use in control and optimization
GPS localization problem: a new model and its global optimization
Recent advances in trust region algorithms
On the complexity of quadratic programming with two quadratic constraints
Continuous methods for extreme and interior eigenvalue problems
A Note on Polynomial Solvability of the CDT Problem
Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
Solving Generalized CDT Problems via Two-Parameter Eigenvalues
On the Solution of the GPS Localization and Circle Fitting Problems
Computing a Trust Region Step
Finding a Global Optimal Solution for a Quadratically Constrained Fractional Quadratic Problem with Applications to the Regularized Total Least Squares
Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition
Computing Optimal Locally Constrained Steps
Newton’s Method with a Model Trust Region Modification
Parameter-free convex equivalent and dual programs of fractional programming problems
Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
Semidefinite relaxation and nonconvex quadratic optimization
New Results on Quadratic Minimization
On Local Solutions of the Celis--Dennis--Tapia Subproblem
On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint
Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
Polynomial Solvability of Variants of the Trust-Region Subproblem
A Survey of the S-Lemma
LMI approximations for the radius of the intersection of ellipsoids: Survey.

This page was built for publication: On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints