Duality bound method for the general quadratic programming problem with quadratic constraints

DOI10.1023/A:1026437621223zbMath0997.90058MaRDI QIDQ5925726

Nguyen Van Thoai

Publication date: 19 February 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch-and-bound algorithmduality boundsquadratically constrained quadratic programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Benefits of embedding structural constraints in coherent diagnostic processes, Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, A novel optimization method for nonconvex quadratically constrained quadratic programs, On a decomposition method for nonconvex global optimization, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, On solving nonconvex optimization problems by reducing the duality gap, On duality bound methods for nonconvex global optimization, Strong duality for general quadratic programs with quadratic equality constraints, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• Jointly constrained bilinear programs and related problems: An overview
• Constrained global optimization: algorithms and applications
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• A new semidefinite programming bound for indefinite quadratic forms over a simplex
• Global minimization by reducing the duality gap
• Lagrange duality and partitioning techniques in nonconvex global optimization
• Nondifferentiable optimization and polynomial problems
• A relaxation method for nonconvex quadratically constrained quadratic programs
• Introduction to global optimization
• A new algorithm for solving the general quadratic programming problem
• DC programming: overview.
• Jointly Constrained Biconvex Programming
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Convergent Algorithms for Minimizing a Concave Function
• Semidefinite Programming