A procedure for the one-parametric linear complementarity problem

DOI10.1080/02331939408843953zbMath0819.90111OpenAlexW2037703960MaRDI QIDQ4764898

Hannu Väliaho

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843953

zbMATH Keywords

sufficient matricesparametric quadratic programmingparametric linear programmingprincipal pivotingcriss-cross methodleast-index ruleone-parametric linear complementarity

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Criteria for sufficient matrices, On solving parametric multiobjective quadratic programs with parameters in general locations

Cites Work

• The principal pivoting method revisited
• Sufficient matrices and the linear complementarity problem
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
• Evolution of Linear Programming Computing Techniques
• A unified approach to one-parametric general quadratic programming
• Least-Index Resolution of Degeneracy in Linear Complementarity Problems with Sufficient Matrices
• On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
• A new proof for the criss-cross method for quadratic programming
• The general quadratic optimization problem
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• Monotone solutions of the parametric linear complementarity problem
• Unnamed Item
• Unnamed Item
• Unnamed Item