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

DOI10.1007/S101070050046MaRDI QIDQ1295958zbMATH OpenOpenAlexFDO

Authors M. Shida, Susumu Shindoh, Masakazu Kojima

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

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

Recommendations

• Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP
• Some new search directions for primal-dual interior point methods in semidefinite programming
• Convergence analysis of an inexact infeasible interior point method for semidefinite programming
• A study of search directions in primal-dual interior-point methods for semidefinite programming
• Polynomial convergence of predictor-corrector algorithms for SDLCP based on the M-Z family of directions

Cited in

(10)

• A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
• Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp^∗
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
• On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions
• A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
• Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
• A study of search directions in primal-dual interior-point methods for semidefinite programming

Describes a project that uses

Uses Software

• SDPA

This page was built for publication: Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295958)