Predictor-corrector Methods for a Class of Linear Complementarity Problems

DOI10.1137/0804024zbMath0832.90116OpenAlexW2077192321MaRDI QIDQ4302321

Robert A. Stubbs, Sanjay Mehrotra

Publication date: 14 August 1994

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804024

zbMATH Keywords

linear complementarity problemtrust-regionMizuno-Todd-Ye predictor-corrector method

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (3)

An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity ⋮ A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming ⋮ On the equivalence of linear complementarity problems

This page was built for publication: Predictor-corrector Methods for a Class of Linear Complementarity Problems