A Global Optimization Algorithm for Concave Quadratic Programming Problems

DOI10.1137/0803042MaRDI QIDQ4277514zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

local solutionsimplex algorithmconcave quadratic programmingdimension-reducing procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Nonlinear programming (90C30)

Recommendations

• Global minimization algorithms for concave quadratic programming problems
• A note on composite concave quadratic programming
• A global optimization algorithm for generalized quadratic programming
• A finite algorithm for solving general quadratic problems
• A successive linear approximation algorithm for the global minimization of a concave quadratic program

Cited in

(18)

• On box constrained concave quadratic optimization
• A successive linear approximation algorithm for the global minimization of a concave quadratic program
• Global optimality conditions for some classes of optimization problems
• Global optimality conditions for quadratic \(0-1\) optimization problems
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
• A finite algorithm for solving general quadratic problems
• Block pivoting and shortcut strategies for detecting copositivity
• An algorithm for global minimization of linearly constrained quadratic functions
• A Strategy for Global Convergence in a Sequential Quadratic Programming Algorithm
• scientific article; zbMATH DE number 3848975 (Why is no real title available?)
• Copositive realxation for genera quadratic programming
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems
• Characterizing global optimality for DC optimization problems under convex inequality constraints
• Bilinear modeling solution approach for fixed charge network flow problems
• Global minimization algorithms for concave quadratic programming problems
• A counterexample to a global optimization algorithm
• Optimality conditions and optimization methods for quartic polynomial optimization

This page was built for publication: A Global Optimization Algorithm for Concave Quadratic Programming Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277514)