A procedure for the one-parametric linear complementarity problem

DOI10.1080/02331939408843953MaRDI QIDQ4764898zbMATH OpenOpenAlexFDO

Authors 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

criss-cross methodleast-index ruleone-parametric linear complementarityparametric linear programmingparametric quadratic programmingprincipal pivotingsufficient matrices

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2150958
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• scientific article; zbMATH DE number 1099089
• A method for solving the general parametric linear complementarity problem
• scientific article; zbMATH DE number 1560356

Cites work

• A new proof for the criss-cross method for quadratic programming
• A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
• A unified approach to one-parametric general quadratic programming
• Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
• Evolution of linear programming computing techniques
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3543799 (Why is no real title available?)
• Least-Index Resolution of Degeneracy in Linear Complementarity Problems with Sufficient Matrices
• Monotone solutions of the parametric linear complementarity problem
• On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
• Sufficient matrices and the linear complementarity problem
• The general quadratic optimization problem
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• The principal pivoting method revisited

Cited in

(16)

• A parametric approach to complementarity theory
• The linear complementarity problem with a parametric input
• On the parametric linear complementarity problem
• Criteria for sufficient matrices
• On solving parametric multiobjective quadratic programs with parameters in general locations
• A two-phase algorithm for the multiparametric linear complementarity problem
• Critical sets in one-parametric mathematical programs with complementarity constraints
• Some properties of linear complementarity problem with a parametric P-matrix and its smooth approximation problem with the entropy function
• An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• The Linear Complementary Problem, Sufficient Matrices and the Criss-Cross Method
• scientific article; zbMATH DE number 1099089 (Why is no real title available?)
• scientific article; zbMATH DE number 1560356 (Why is no real title available?)
• scientific article; zbMATH DE number 2150958 (Why is no real title available?)
• A new resolution method for the parametric linear complementarity problem
• A unified tool for solving uni-parametric linear programs, convex quadratic programs, and linear complementarity problems

This page was built for publication: A procedure for the one-parametric linear complementarity problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764898)