Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems

DOI10.1007/s10957-021-01980-2zbMath1484.90061OpenAlexW4206804914MaRDI QIDQ2073059

Amar Andjouh, Mohand Ouamer Bibi

Publication date: 27 January 2022

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-021-01980-2

zbMATH Keywords

global optimizationoptimality conditionsbox constraintsabstract convexityconvex supportadaptive global algorithm (AGA)non-convex quadratic minimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Uses Software

• QuadProgBB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient global optimality conditions for bivalent quadratic optimization
• DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
• Global optimization algorithms for linearly constrained indefinite quadratic problems
• Generalized Fenchel's conjugation formulas and duality for abstract convex functions
• An approximate decomposition algorithm for convex minimization
• Global optimality conditions for some classes of optimization problems
• Quadratic programming with one negative eigenvalue is NP-hard
• A block active set algorithm for large-scale quadratic programming with box constraints
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Global and local quadratic minimization
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
• A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• Globally solving nonconvex quadratic programming problems via completely positive programming
• A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
• Introduction to global optimization
• Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
• Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
• An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
• A hybrid direction algorithm for solving a convex quadratic problem
• Sufficient global optimality conditions for weakly convex minimization problems
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
• A sequential method for a class of box constrained quadratic programming problems
• Nonconvex piecewise-quadratic underestimation for global minimization
• Dual support method for solving convex quadratic programs
• A Global Optimization Algorithm for Concave Quadratic Programming Problems
• Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
• Construction of test problems in quadratic bivalent programming
• A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
• Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
• Abstract convexity and global optimization

This page was built for publication: Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems