Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP

DOI10.1137/S1052623496300611zbMath0913.90252OpenAlexW2040773875MaRDI QIDQ4389197

Susumu Shindoh, Kojima, Masakazu, Masayuki Shida

Publication date: 12 May 1998

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

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

zbMATH Keywords

monotonicityinterior-point algorithmsemidefinite linear complementarity problemsemidefinite program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP, A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming, Linear systems in Jordan algebras and primal-dual interior-point algorithms, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, Low-order penalty equations for semidefinite linear complementarity problems, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, On the \(P_2'\) and \(P_2\)-properties in the semidefinite linear complementarity problem, A study of search directions in primal-dual interior-point methods for semidefinite programming, A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming, On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions