Properties of the general quadratic optimization problem and the corresponding linear complementarity problem

DOI10.1080/02331938708843212zbMath0622.90062OpenAlexW2044266204MaRDI QIDQ3760297

Jürgen Sommerschuh

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843212

zbMATH Keywords

local minimumlinear complementarityconvex polyhedroncutting planenondegeneracyKuhn-Tucker conditionsquadratic nonconvex functionopen face

Mathematics Subject Classification ID

Nonlinear programming (90C30) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

Some properties of solution sets to nonconvex quadratic programming problems

Cites Work

• The general quadratic optimization problem
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• A method for solving maximum-problems with a nonconcave quadratic objective function
• Letter to the Editor—On the Convexity of Quadratic Forms Over Convex Sets
• Unnamed Item

This page was built for publication: Properties of the general quadratic optimization problem and the corresponding linear complementarity problem