Pages that link to "Item:Q1295958"
From MaRDI portal
The following pages link to Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation (Q1295958):
Displaying 10 items.
- A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem (Q331977) (← links)
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path (Q721594) (← links)
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization (Q1644574) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q1928163) (← links)
- A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
- Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp<sup>∗</sup> (Q4235448) (← links)
- A study of search directions in primal-dual interior-point methods for semidefinite programming (Q4504774) (← links)
- On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions (Q4504776) (← links)
