Quadratic programming problems and related linear complementarity problems
type: Item
instance of: scholarly article
title: Quadratic programming problems and related linear complementarity problems
zbMATH Open document ID: 0674.90075
DOI: 10.1007/BF01102342
published in: Journal of Optimization Theory and Applications
publication date: 1990-01-01T00:00:00Z
review text: This paper investigates the general quadratic programming problem, i.e., the problem of finding the minimum of a quadratic function subject to linear constraints. In the case that, over the set of feasible points, the objective function is bounded from below, this problem can be solved by the minimization of a linear function, subject to the solution set of a linear complementarity problem, representing the Kuhn-Tucker conditions of the quadratic problem. To detect in the quadratic problem the unboundedness from below of the objective function, necessary and sufficient conditions are derived. It is shown that, applying these conditions, the general quadratic programming problem becomes equivalent to the investigation of an appropriately formulated linear complementarity problem.
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 4104723
zbMATH Keywords: nonconvex quadratic programming
zbMATH Keywords: cutting plane methods
zbMATH Keywords: linear constraints
zbMATH Keywords: linear complementarity
zbMATH Keywords: unboundedness from below
author: Heinz Bernau
MaRDI profile type: Publication
cites work: The Simplex Method for Quadratic Programming
cites work: Q5592809
cites work: Simplicial methods for quadratic programming
cites work: A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure
cites work: Q5608986
cites work: Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe
cites work: Q3664850
cites work: Nonconvex Quadratic Programming via Generalized Polars
cites work: Optimization with disjunctive constraints
cites work: Application of disjunctive programming to the linear complementarity problem
cites work: Q3844775
cites work: The Linear Complementarity Problem
cites work: On Quadratic Programming
cites work: Quasi-concave minimization subject to linear constraints
cites work: A finite procedure to generate feasible points for the extreme point mathematical programming problem
cites work: Eine modiiiziemng des hauptsatzes der komplementarität
cites work: On the redundancy of cutting planes for linear complementarity problems
description: scientific article; zbMATH DE number 4104723