Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron

DOI10.1287/moor.16.2.390zbMath0741.90068OpenAlexW2168251031MaRDI QIDQ3978620

Lakshman S. Thakur

Publication date: 25 June 1992

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.16.2.390

zbMATH Keywords

global optimizationlinear inequality constraintsbranch-and-boundglobal minimizerconcave quadratic function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An algorithm for indefinite integer quadratic programming, Nonconvex optimization over a polytope using generalized capacity improvement, A branch-and-reduce approach to global optimization, Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming, Domain reduction techniques for global NLP and MINLP optimization, Maximizing strictly convex quadratic functions with bounded perturbations, Quasiconvex relaxations based on interval arithmetic, Unnamed Item, A geometric branch and bound method for robust maximization of convex functions

Uses Software

• EISPACK