A Global Optimization Algorithm for Concave Quadratic Programming Problems
From MaRDI portal
Publication:4277514
DOI10.1137/0803042zbMath0798.90116OpenAlexW1999584386MaRDI QIDQ4277514
Immanuel M. Bomze, Gabriele Danninger
Publication date: 7 February 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803042
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items
Bilinear modeling solution approach for fixed charge network flow problems ⋮ Optimality conditions and optimization methods for quartic polynomial optimization ⋮ Characterizing global optimality for DC optimization problems under convex inequality constraints ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositive realxation for genera quadratic programming ⋮ Global optimality conditions for some classes of optimization problems ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems ⋮ Block pivoting and shortcut strategies for detecting copositivity ⋮ A finite algorithm for solving general quadratic problems
This page was built for publication: A Global Optimization Algorithm for Concave Quadratic Programming Problems
