Pages that link to "Item:Q5704080"
From MaRDI portal
The following pages link to An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems (Q5704080):
Displayed 10 items.
- Finding a strict feasible solution of a linear semidefinite program (Q632881) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
- Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence (Q2007836) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts (Q2802535) (← links)
- An alternating direction method for solving convex nonlinear semidefinite programming problems (Q2841143) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- Learning lyapunov functions for hybrid systems (Q6201594) (← links)