Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint

DOI10.1007/s10898-010-9625-6zbMath1281.90032OpenAlexW2009472201MaRDI QIDQ693140

Joe-Mei Feng, Reuy-Lin Sheu, Yong Xia, Gang-Xuan Lin

Publication date: 7 December 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9625-6

zbMATH Keywords

dualitynonconvex quadratic programminghidden convexitySlater's conditionsimultaneously diagonalizable via congruence

Mathematics Subject Classification ID

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

Related Items (19)

SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices ⋮ Double well potential function and its optimization in the \(N\)-dimensional real space. I ⋮ Double well potential function and its optimization in the \(N\)-dimensional real space. II ⋮ Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems ⋮ On Local Non-Global Minimizers of Quadratic Optimization Problem with a Single Quadratic Constraint ⋮ Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem ⋮ Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems ⋮ Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint ⋮ Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint ⋮ A notion of compliance robustness in topology optimization ⋮ On Conic Relaxations of Generalization of the Extended Trust Region Subproblem ⋮ An SDP approach for quadratic fractional problems with a two-sided quadratic constraint ⋮ Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem ⋮ A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint ⋮ Strong duality for general quadratic programs with quadratic equality constraints ⋮ On minimizing the ratio of quadratic functions over an ellipsoid ⋮ A Linear-Time Algorithm for Generalized Trust Region Subproblems ⋮ The generalized trust region subproblem: solution complexity and convex hull results ⋮ S-lemma with equality and its applications

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• On the stability of a dual weak vector variational inequality problem
• Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma
• Global extremal conditions for multi-integer quadratic programming
• Global optimization for a class of fractional programming problems
• Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint
• Quadratically constrained least squares and quadratic problems
• Canonical duality theory and solutions to constrained nonconvex quadratic programming
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• Computing a Trust Region Step
• Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
• Matrix Analysis
• Computing Optimal Locally Constrained Steps
• An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• New Results on Quadratic Minimization
• The trust region subproblem and semidefinite programming*
• Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
• On Cones of Nonnegative Quadratic Functions
• Canonical dual transformation method and generalized triality theory in nonsmooth global optimization

This page was built for publication: Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint