Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions

DOI10.1007/s10107980021azbMath0971.90057OpenAlexW1560108784MaRDI QIDQ1572670

Renato D. C. Monteiro, Takashi Tsuchiya

Publication date: 21 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2433/61438

zbMATH Keywords

semidefinite programming interior-point methods polynomial complexity path-following methods primal-dual methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (6)

A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ Discretization method for semi-definite programming ⋮ Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions

This page was built for publication: Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions