A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming

DOI10.1016/J.AMC.2014.11.032MaRDI QIDQ902804zbMATH OpenOpenAlexFDO

Authors Nan Lu, Hong-Wei Jiao, Sanyang Liu

Publication date 4 January 2016

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

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

zbMATH Keywords

global optimizationnonconvex quadratic programmingparametric linearized techniquepruning operation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonconvex programming, global optimization (90C26)

Recommendations

• A global optimization algorithm using parametric linearization relaxation
• An accelerating algorithm for globally solving nonconvex quadratic programming
• An effective algorithm for globally solving quadratic programs using parametric linearization technique
• A global optimization algorithm for generalized quadratic programming
• A global optimization algorithm using linear relaxation

Cites work

• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• A deterministic global optimization algorithm for generalized geometric programming
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A global optimization algorithm for generalized quadratic programming
• A global optimization algorithm using parametric linearization relaxation
• A global optimization approach for quadratic programs with nonconvex quadratic constraints
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• Approximating global quadratic optimization with convex quadratic constraints
• Approximation algorithms for quadratic programming
• Branch-reduction-bound algorithm for generalized geometric programming
• Duality bound method for the general quadratic programming problem with quadratic constraints
• Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
• Global optimization of generalized geometric programming
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• Handbook of test problems in local and global optimization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Linearization method of global optimization for generalized geometric programming
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems

Cited in

(14)

• A new global optimization algorithm for solving a class of nonconvex programming problems
• Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
• An accelerating algorithm for globally solving nonconvex quadratic programming
• An effective global optimization algorithm for quadratic programs with quadratic constraints
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• A global optimization algorithm using linear relaxation
• Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
• Parametric approach to a class of nonconvex global optimization problems
• An efficient algorithm for computing a class of multiplicative optimization problem
• Solving generalized polynomial problem by using new affine relaxed technique
• A global optimization algorithm using parametric linearization relaxation
• An effective algorithm for globally solving quadratic programs using parametric linearization technique
• A parametric linearizing approach for quadratically inequality constrained quadratic programs
• Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition

This page was built for publication: A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming

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