A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
From MaRDI portal
Publication:902804
DOI10.1016/j.amc.2014.11.032zbMath1328.65137OpenAlexW2005653305MaRDI QIDQ902804
Nan Lu, Hong-Wei Jiao, San-Yang 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
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (9)
An accelerating algorithm for globally solving nonconvex quadratic programming ⋮ A parametric linearizing approach for quadratically inequality constrained quadratic programs ⋮ Solving generalized polynomial problem by using new affine relaxed technique ⋮ An efficient algorithm for computing a class of multiplicative optimization problem ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems ⋮ An effective algorithm for globally solving quadratic programs using parametric linearization technique ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- Unnamed Item
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A global optimization algorithm using parametric linearization relaxation
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Handbook of test problems in local and global optimization
- Approximating global quadratic optimization with convex quadratic constraints
- Approximation algorithms for quadratic programming
- Linearization method of global optimization for generalized geometric programming
- Global optimization of generalized geometric programming
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A global optimization algorithm for generalized quadratic programming
- 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
- Branch-reduction-bound algorithm for generalized geometric programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A deterministic global optimization algorithm for generalized geometric programming
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Duality bound method for the general quadratic programming problem with quadratic constraints
This page was built for publication: A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
