A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
zbMATH Open1209.65056MaRDI QIDQ3070586FDOQ3070586
Yi Chen, Yanqin Bai, Liming Sun
Publication date: 3 February 2011
Recommendations
- Complexity analysis of primaldual algorithms for the semidefinite linear complementarity problem
- A full Nesterov-Todd step primal-dual path-following interior point algorithm for semidefinite linear complementarity problems
- A path-following interior-point algorithm for linear and quadratic problems
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction
polynomial complexityinterior-point algorithmfull-Newton stepsmall-update methodmonotone semidefinite linear complementarity problems
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30) Interior-point methods (90C51) Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (5)
- Title not available (Why is that?)
- Path-following interior-point algorithm for monotone linear complementarity problems
- A generalized direction in interior point method for monotone linear complementarity problems
- Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
This page was built for publication: A new path-following interior-point algorithm for monotone semidefinite linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070586)
