A robust algorithm for quadratic optimization under quadratic constraints

DOI10.1007/s10898-006-9063-7zbMath1198.90316OpenAlexW2027006974MaRDI QIDQ2385494

N. T. Hoai-Phuong, Hoang Tuy

Publication date: 12 October 2007

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

Full work available at URL: https://doi.org/10.1007/s10898-006-9063-7

zbMATH Keywords

nonconvex global optimizationrobust solutionessential optimal solutionbranch-reduce-and-bound successive incumbent transcending algorithmquadratic optimization under quadratic constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20)

Related Items

Large-scale standard pooling problems with constrained pools and fixed demands, Quadratic minimisation problems in statistics, A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints, Remarks on solutions to a nonconvex quadratic programming test problem, Global optimization for the generalized polynomial sum of ratios problem, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Handbook of test problems in local and global optimization
• Nondifferentiable optimization and polynomial problems
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Robust solution of nonconvex global optimization problems
• Monotonic Optimization: Problems and Solution Approaches
• Global Optimization with Polynomials and the Problem of Moments
• A set of geometric programming test problems and their solutions
• Monotonic Optimization: Branch and Cut Methods
• Discrete Monotonic Optimization with Application to a Discrete Location Problem
• Convex analysis and global optimization