Resolving degeneracy in quadratic programming
From MaRDI portal
Publication:1312769
DOI10.1007/BF02023102zbMath0796.90042OpenAlexW2092068641MaRDI QIDQ1312769
Publication date: 26 September 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02023102
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (12)
Corrected sequential linear programming for sparse minimax optimization ⋮ Primal and dual active-set methods for convex quadratic programming ⋮ Finding normal solutions in piecewise linear programming ⋮ Iterative schemes for the least 2-norm solution of piecewise linear programs ⋮ A quasi-second-order proximal bundle algorithm ⋮ A factorization with update procedures for a KKT matrix arising in direct optimal control ⋮ Analytical aspects of tie breaking ⋮ On the effectiveness of sequential linear programming for the pooling problem ⋮ Dominant speed factors of active set methods for fast MPC ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ On degeneracy in linear programming and related problems ⋮ Dual toll pricing for hazardous materials transport with linear delay
Uses Software
Cites Work
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Degeneracy in the presence of roundoff errors
- On the solution of highly degenerate linear programmes
- A practical anti-cycling procedure for linearly constrained optimization
- Ordering algorithms for irreducible sparse linear systems
- Inertia-Controlling Methods for General Quadratic Programming
- On the quadratic programming algorithm of Goldfarb and Idnani
- A Technique for Resolving Degeneracy in Linear Programming
- Pivot selection methods of the Devex LP code
This page was built for publication: Resolving degeneracy in quadratic programming
