Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation

DOI10.1007/s101070050046zbMath0948.90115OpenAlexW2030566225MaRDI QIDQ1295958

Masayuki Shida, Susumu Shindoh, Kojima, Masakazu

Publication date: 23 September 1999

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

Full work available at URL: https://doi.org/10.1007/s101070050046

zbMATH Keywords

semidefinite programminginterior-point methodssemidefinite linear complementarity probleminexact computationsearch direction

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items

A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization, A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem, A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics, A study of search directions in primal-dual interior-point methods for semidefinite programming, On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions

Uses Software

• SDPA