Strong duality for general quadratic programs with quadratic equality constraints

DOI10.1007/S10957-022-02082-3OpenAlexW4293113683MaRDI QIDQ2082247FDOQ2082247

Duy-Van Nguyen

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

zbMATH Keywords

quadratic programmingcopositive matricesstrong duality for nonconvex optimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• An Adaptive Linear Approximation Algorithm for Copositive Programs
• Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
• Canonical duality theory and solutions to constrained nonconvex quadratic programming
• Nondifferentiable optimization and polynomial problems
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Duality bound method for the general quadratic programming problem with quadratic constraints
• Completely positive and copositive program modelling for quadratic optimization problems
• Strong duality for a trust-region type relaxation of the quadratic assignment problem
• Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
• Special issue: Selected papers of the international workshop on global optimization, GO '99. Firenze, Italy, 1999
• General Quadratic Programming
• Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams

Cited In (4)

• Duality and solutions for quadratic programming over single non-homogeneous quadratic constraint
• Quadratic problems with two quadratic constraints: convex quadratic relaxation and strong lagrangian duality
• Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere
• Duality bound method for the general quadratic programming problem with quadratic constraints

This page was built for publication: Strong duality for general quadratic programs with quadratic equality constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082247)