Pages that link to "Item:Q2802537"
From MaRDI portal
The following pages link to Block Coordinate Descent Methods for Semidefinite Programming (Q2802537):
Displaying 17 items.
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- On the complexity analysis of randomized block-coordinate descent methods (Q494345) (← links)
- Multi-label Lagrangian support vector machine with random block coordinate descent method (Q1750531) (← links)
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
- A penalty decomposition method for rank minimization problem with affine constraints (Q2282364) (← links)
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function (Q2452370) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
- An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
- A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming (Q4596724) (← links)
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization (Q4602339) (← links)
- (Q4636989) (← links)
- FANOK: Knockoffs in Linear Time (Q5154638) (← links)
- An alternating minimization method for robust principal component analysis (Q5238069) (← links)
- Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586) (← links)
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization (Q5355205) (← links)