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

DOI10.1287/MOOR.16.2.390MaRDI QIDQ3978620zbMATH OpenOpenAlexFDO

Authors 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 optimizationbranch-and-boundglobal minimizerlinear inequality constraintsconcave quadratic function

Mathematics Subject Classification ID

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

Recommendations

• Quadratic optimization over a polyhedral cone
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
• A projection and contraction method for convex quadratic programming
• Minimizing Piecewise-Concave Functions Over Polyhedra
• Concave programming for minimizing the zero-norm over polyhedral sets
• Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
• Conic approximation to quadratic optimization with linear complementarity constraints
• The convex hull of a quadratic constraint over a polytope
• Publication:4349640

Cited in

(10)

• Polyhedral annexation, dualization and dimension reduction technique in global optimization
• scientific article; zbMATH DE number 1330764 (Why is no real title available?)
• An algorithm for indefinite integer quadratic programming
• Nonconvex optimization over a polytope using generalized capacity improvement
• Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming
• A branch-and-reduce approach to global optimization
• A geometric branch and bound method for robust maximization of convex functions
• Maximizing strictly convex quadratic functions with bounded perturbations
• Domain reduction techniques for global NLP and MINLP optimization
• Quasiconvex relaxations based on interval arithmetic

Describes a project that uses

Uses Software

• EISPACK

This page was built for publication: Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron

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