Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
DOI10.1007/S101070050046zbMATH Open0948.90115OpenAlexW2030566225MaRDI QIDQ1295958FDOQ1295958
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
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
semidefinite programminginterior-point methodssemidefinite linear complementarity probleminexact computationsearch direction
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 (10)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- 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
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem
- 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
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗
Uses Software
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)
