An accelerating algorithm for globally solving nonconvex quadratic programming
From MaRDI portal
Publication:824677
DOI10.1186/s13660-018-1764-1zbMath1498.90149OpenAlexW2884617661WikidataQ91103320 ScholiaQ91103320MaRDI QIDQ824677
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1764-1
global optimizationbranch and boundnonconvex quadratic programminglinear relaxation approachdeleting technique
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20)
Cites Work
- Unnamed Item
- Global minimization of a generalized linear multiplicative programming
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Linear decomposition approach for a class of nonconvex programming problems
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A global optimization algorithm using parametric linearization relaxation
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- A new global optimization approach for convex multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A global optimization approach for solving the convex multiplicative programming problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Primal-relaxed dual global optimization approach
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A decomposition algorithm for solving large-scale quadratic programming problems
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
- A Robust Algorithm for Solving Nonlinear Programming Problems
- Synthesis of globally optimal controllers for robust performance to unstructured uncertainty
- An infeasible active-set QP-free algorithm for general nonlinear programming
- A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming
