Strong duality for general quadratic programs with quadratic equality constraints
From MaRDI portal
Publication:2082247
DOI10.1007/s10957-022-02082-3OpenAlexW4293113683MaRDI QIDQ2082247
Publication date: 4 October 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02082-3
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Nondifferentiable optimization and polynomial problems
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Strong duality for a trust-region type relaxation of the quadratic assignment problem
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Semi-Infinite Programming: Theory, Methods, and Applications
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Completely positive and copositive program modelling for quadratic optimization problems
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams
- General Quadratic Programming
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- Duality bound method for the general quadratic programming problem with quadratic constraints
- Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
This page was built for publication: Strong duality for general quadratic programs with quadratic equality constraints
