A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints

DOI10.1016/j.amc.2007.08.015zbMath1141.65048OpenAlexW2094565872MaRDI QIDQ2479256

Huizhuo Wu, Ke-Cun Zhang

Publication date: 26 March 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2007.08.015

zbMATH Keywords

algorithmglobal optimizationconvergencenumerical examplesbranch and bounddeleting techniquelinearizing methodaccelerating methodnon-convex quadratic constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, Global optimization algorithm for a generalized linear multiplicative programming, An out space accelerating algorithm for generalized affine multiplicative programs problem

Cites Work

• A global optimization algorithm using parametric linearization relaxation
• Approximating global quadratic optimization with convex quadratic constraints
• Primal-relaxed dual global optimization approach
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
• Linearization method of global optimization for generalized geometric programming
• Difference of convex solution of quadratically constrained optimization problems.
• Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
• Synthesis of globally optimal controllers for robust performance to unstructured uncertainty