Quadratic programming problems and related linear complementarity problems

DOI10.1007/BF01102342zbMath0674.90075MaRDI QIDQ1121791

Heinz Bernau

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

linear complementaritynonconvex quadratic programminglinear constraintscutting plane methodsunboundedness from below

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A finite procedure to generate feasible points for the extreme point mathematical programming problem
• Optimization with disjunctive constraints
• Quasi-concave minimization subject to linear constraints
• Nonconvex Quadratic Programming via Generalized Polars
• The Simplex Method for Quadratic Programming
• Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe
• On the redundancy of cutting planes for linear complementarity problems
• Eine modiiiziemng des hauptsatzes der komplementarität
• Application of disjunctive programming to the linear complementarity problem
• Simplicial methods for quadratic programming
• A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure
• The Linear Complementarity Problem
• On Quadratic Programming

This page was built for publication: Quadratic programming problems and related linear complementarity problems