A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming

DOI10.1016/J.AMC.2014.11.032zbMATH Open1328.65137OpenAlexW2005653305MaRDI QIDQ902804FDOQ902804

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

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

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)

Cites Work

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

Cited In (14)

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

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)