Quadratic programming problems and related linear complementarity problems
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.
- A quadratic programming view of the linear complementary problem
- Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe
- Linear complementarity procedures in quadratic programming
- scientific article; zbMATH DE number 4185418
- scientific article; zbMATH DE number 4154237
- A finite procedure to generate feasible points for the extreme point mathematical programming problem
- A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure
- Application of disjunctive programming to the linear complementarity problem
- Eine modiiiziemng des hauptsatzes der komplementarität
- scientific article; zbMATH DE number 3817438 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3312380 (Why is no real title available?)
- scientific article; zbMATH DE number 3332061 (Why is no real title available?)
- Nonconvex Quadratic Programming via Generalized Polars
- On Quadratic Programming
- On the redundancy of cutting planes for linear complementarity problems
- Optimization with disjunctive constraints
- Quasi-concave minimization subject to linear constraints
- Simplicial methods for quadratic programming
- The Linear Complementarity Problem
- The Simplex Method for Quadratic Programming
- Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe
- A note on a quadratic formulation for linear complementarity problems
- A generalized problem of quadratic programming
- A method of complementary basis for quadratic programming
- Basis- and partition identification for quadratic programming and linear complementarity problems
- On convex quadratic programs with linear complementarity constraints
- A quadratic programming view of the linear complementary problem
- Über die ä quivalenz der allgemeinen quadratischen optimierungsaufgabe zu einer linearen parametrischen komplementären optimierungsaufgabe
- scientific article; zbMATH DE number 4154237 (Why is no real title available?)
- Quadratic programming analogs
- Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
- scientific article; zbMATH DE number 4068621 (Why is no real title available?)
- scientific article; zbMATH DE number 757652 (Why is no real title available?)
- General Quadratic Programming
- A note on the linear complementarity problem involving a subgradient
- A class of quadratic programs with linear complementarity constraints
- Quadratic programming and combinatorial minimum weight product problems
This page was built for publication: Quadratic programming problems and related linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121791)
