On zero duality gap in nonconvex quadratic programming problems
From MaRDI portal
Publication:421278
DOI10.1007/s10898-011-9660-yzbMath1266.90151OpenAlexW2070240105WikidataQ57445448 ScholiaQ57445448MaRDI QIDQ421278
Publication date: 23 May 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9660-y
SDP relaxationduality gapsufficient conditionsLagrangian dualcell enumerationnonconvex quadratic program
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items
First- and second-order optimality conditions for quadratically constrained quadratic programming problems, On the local stability of semidefinite relaxations, Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique, Generalized S-lemma and strong duality in nonconvex quadratic programming, Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint, On the quadratic fractional optimization with a strictly convex quadratic constraint, The unconstrained binary quadratic programming problem: a survey, A Unified Framework for Pricing in Nonconvex Resource Allocation Games, Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Worst-case analysis of Gini mean difference safety measure, A new algorithm for concave quadratic programming
Cites Work
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- Sufficient global optimality conditions for bivalent quadratic optimization
- A new linearization technique for multi-quadratic 0-1 programming problems.
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- On the stability of a dual weak vector variational inequality problem
- Global extremal conditions for multi-integer quadratic programming
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Global minimization of indefinite quadratic problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Conditions for global optimality. II
- Testing optimality for quadratic 0-1 problems
- Semidefinite programming relaxation for nonconvex quadratic programs
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Quadratic maximization and semidefinite relaxation
- Seizure warning algorithm based on optimization and nonlinear dynamics
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Reverse search for enumeration
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- Global optimality conditions for mixed nonconvex quadratic programs†
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- New Results on Quadratic Minimization
- Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
- Semidefinite Programming
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- A Survey of the S-Lemma
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
