Pages that link to "Item:Q1626538"
From MaRDI portal
The following pages link to Subgradient methods for sharp weakly convex functions (Q1626538):
Displayed 13 items.
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
- Sufficient conditions for a minimum of a strongly quasiconvex function on a weakly convex set (Q2113393) (← links)
- On the gradient projection method for weakly convex functions on a proximally smooth set (Q2217258) (← links)
- Characterization of solutions of strong-weak convex programming problems (Q3382765) (← links)
- Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
- Low rank matrix recovery with adversarial sparse noise* (Q5030160) (← links)
- Graphical Convergence of Subgradients in Nonconvex Optimization and Learning (Q5076697) (← links)
- Exact Recovery of Multichannel Sparse Blind Deconvolution via Gradient Descent (Q5143310) (← links)
- An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems (Q5162651) (← links)
- Nonconvex Robust Low-Rank Matrix Recovery (Q5217366) (← links)
- Lyapunov stability of the subgradient method with constant step size (Q6052064) (← links)
- Sufficient conditions for the linear convergence of an algorithm for finding the metric projection of a point onto a convex compact set (Q6114298) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)