An accelerating algorithm for globally solving nonconvex quadratic programming

DOI10.1186/S13660-018-1764-1zbMATH Open1498.90149OpenAlexW2884617661WikidataQ91103320 ScholiaQ91103320MaRDI QIDQ824677FDOQ824677

Authors: Li Ge, Sanyang Liu 

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

Recommendations

• scientific article; zbMATH DE number 5630592
• A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
• A global optimization algorithm for generalized quadratic programming
• A new accelerating method for solving quadratic programming
• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming

zbMATH Keywords

global optimizationbranch and boundnonconvex quadratic programminglinear relaxation approachdeleting technique

Mathematics Subject Classification ID

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

Cites Work

• A globally convergent trust region multidimensional filter SQP algorithm for nonlinear programming
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A branch and cut algorithm for nonconvex quadratically constrained quadratic 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
• A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs
• Preprocessing Nonlinear Functional Constraints with Applications to the Pooling Problem
• Linear decomposition approach for a class of nonconvex programming problems
• Primal-relaxed dual global optimization approach
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
• A Robust Algorithm for Solving Nonlinear Programming Problems
• A global optimization approach for solving the convex multiplicative programming problem
• 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
• Global minimization of a generalized linear multiplicative programming
• A global optimization algorithm using parametric linearization relaxation
• An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
• A nonisolated optimal solution of general linear multiplicative programming problems
• A decomposition algorithm for solving large-scale quadratic programming problems
• A new rectangle branch-and-reduce approach for solving nonconvex quadratic 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 parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
• A new global optimization approach for convex multiplicative programming

Cited In (11)

• A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming
• A linearization method for global optimal solution of quadratic programming problem with nonconvex quadratic constraints
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
• A new accelerating method for globally solving a class of nonconvex programming problems
• A new accelerating method for solving quadratic programming
• Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
• An efficient DCA algorithm for solving non-monotone affine variational inequality problem
• A new accelerating method for global non-convex quadratic optimization with non-convex quadratic constraints
• A global optimization algorithm for generalized quadratic programming
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: An accelerating 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 Q824677)