Pages that link to "Item:Q2067681"

The following pages link to Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681):

Displayed 12 items.

• Proximal methods avoid active strict saddles of weakly convex functions (Q2143222) ‎ (← links)
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) ‎ (← links)
• Nonsmooth rank-one matrix factorization landscape (Q2673521) ‎ (← links)
• A low-rank spectral method for learning Markov models (Q2679005) ‎ (← links)
• Low rank matrix recovery with adversarial sparse noise* (Q5030160) ‎ (← links)
• GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery (Q5089733) ‎ (← links)
• Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) ‎ (← links)
• Lyapunov stability of the subgradient method with constant step size (Q6052064) ‎ (← links)
• Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs (Q6109969) ‎ (← links)
• Certifying the Absence of Spurious Local Minima at Infinity (Q6116236) ‎ (← links)
• Robust matrix estimations meet Frank-Wolfe algorithm (Q6134341) ‎ (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) ‎ (← links)