Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
type: Item
instance of: scholarly article
title: Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
zbMATH Open document ID: 1484.90061
author: Amar Andjouh
author: Mohand Ouamer Bibi
published in: Journal of Optimization Theory and Applications
publication date: 2022-01-27T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7465219
zbMATH Keywords: global optimization
zbMATH Keywords: non-convex quadratic minimization
zbMATH Keywords: optimality conditions
zbMATH Keywords: box constraints
zbMATH Keywords: convex support
zbMATH Keywords: abstract convexity
zbMATH Keywords: adaptive global algorithm (AGA)
describes a project that uses: QuadProgBB
MaRDI profile type: Publication
full work available at URL: s10957-021-01980-2
OpenAlex ID: W4206804914
cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints
cites work: Global and local quadratic minimization
cites work: A hybrid direction algorithm for solving a convex quadratic problem
cites work: A Global Optimization Algorithm for Concave Quadratic Programming Problems
cites work: Dual support method for solving convex quadratic programs
cites work: A sequential method for a class of box constrained quadratic programming problems
cites work: Globally solving nonconvex quadratic programming problems via completely positive programming
cites work: A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables
cites work: A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints
cites work: A block active set algorithm for large-scale quadratic programming with box constraints
cites work: Q4693095
cites work: Q4739659
cites work: An algorithm for the minimization of nonsmooth nonconvex functions using inexact evaluations and its worst-case complexity
cites work: Q4209438
cites work: Introduction to global optimization
cites work: Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints
cites work: Generalized Fenchel's conjugation formulas and duality for abstract convex functions
cites work: An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: Convergence analysis of difference-of-convex algorithm with subanalytic data
cites work: DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
cites work: An approximate decomposition algorithm for convex minimization
cites work: Nonconvex piecewise-quadratic underestimation for global minimization
cites work: Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems
cites work: Construction of test problems in quadratic bivalent programming
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
cites work: Sufficient global optimality conditions for bivalent quadratic optimization
cites work: An effective generalization of the direct support method in quadratic convex programming
cites work: Abstract convexity and global optimization
cites work: Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: Sufficient global optimality conditions for weakly convex minimization problems
cites work: Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
cites work: Global optimality conditions for some classes of optimization problems
cites work: Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
DOI: 10.1007/S10957-021-01980-2
description: scientific article; zbMATH DE number 7465219