Pages that link to "Item:Q2236545"

The following pages link to A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion (Q2236545):

Displaying 7 items.

• Bregman primal-dual first-order method and application to sparse semidefinite programming (Q2070334) (← links)
• An interior point-proximal method of multipliers for linear positive semi-definite programming (Q2073047) (← links)
• A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics (Q2089080) (← links)
• A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
• Provably faster gradient descent via long steps (Q6579999) (← links)
• Multichannel frequency estimation with constant amplitude via convex structured low-rank approximation (Q6623660) (← links)
• Loraine – an interior-point solver for low-rank semidefinite programming (Q6661108) (← links)