An infeasible-start path-following method for monotone LCPs

DOI10.1016/S0895-7177(03)90003-3zbMath1080.90075MaRDI QIDQ597439

Xing-Si Li, Pei-Ai Zhang

Publication date: 6 August 2004

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

LCPAlgebraically equivalent pathInterior-point methodPath-following method

Mathematics Subject Classification ID

Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem

Cites Work

• An infeasible-interior-point algorithm for linear complementarity problems
• On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• Path-Following Methods for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Modified Projection-Type Methods for Monotone Variational Inequalities
• Global Convergence Properties of Some Iterative Methods for Linear Complementarity Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An infeasible-start path-following method for monotone LCPs