Least-index resolution of degeneracy in quadratic programming
From MaRDI portal
Publication:3902831
Cites work
- scientific article; zbMATH DE number 3561096 (Why is no real title available?)
- scientific article; zbMATH DE number 3288282 (Why is no real title available?)
- A Technique for Resolving Degeneracy in Linear Programming
- A Transformation of Which The Equation of Telegraphy is a Differential Invariant
- A note on cycling in the simplex method
- New Finite Pivoting Rules for the Simplex Method
- Optimality and Degeneracy in Linear Programming
- Optimality conditions for quadratic programming
- Symmetric dual quadratic programs
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
- The general quadratic optimization problem
- The generalized simplex method for minimizing a linear form under linear inequality restraints
Cited in
(10)- Almost definiteness of matrices on polyhedral cones
- Quadratic-programming criteria for copositive matrices
- Systematic construction of examples for cycling in the simplex method
- Some generalizations of the criss-cross method for quadratic programming
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming
- Pivot rules for linear programming: A survey on recent theoretical developments
- Selected bibliography on degeneracy
- Almost copositive matrices
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- Equivalence of some quadratic programming algorithms
This page was built for publication: Least-index resolution of degeneracy in quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902831)
