Pages that link to "Item:Q5162656"
From MaRDI portal
The following pages link to An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656):
Displaying 8 items.
- Learning Dynamical Systems with Side Information (Q5883299) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates (Q6114786) (← links)
- A strict complementarity approach to error bound and sensitivity of solution of conic programs (Q6164955) (← links)
- On optimal universal first-order methods for minimizing heterogeneous sums (Q6191975) (← links)
- Provably faster gradient descent via long steps (Q6579999) (← links)
- Cardinality-constrained structured data-fitting problems (Q6584338) (← links)
- Accelerated first-order methods for a class of semidefinite programs (Q6665390) (← links)
