Pages that link to "Item:Q5299902"
From MaRDI portal
The following pages link to Logarithmic barriers for sparse matrix cones (Q5299902):
Displayed 8 items.
- Inexact proximal Newton methods for self-concordant functions (Q522088) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
- GMRES-Accelerated ADMM for Quadratic Objectives (Q4554067) (← links)
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing (Q5268929) (← links)
- A Smoothing Method for Sparse Optimization over Polyhedral Sets (Q5357000) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- Performance enhancements for a generic conic interior point algorithm (Q6102857) (← links)