Pages that link to "Item:Q5242862"

The following pages link to Gradient descent with non-convex constraints: local concavity determines convergence (Q5242862):

Displaying 14 items.

• The gradient projection algorithm for smooth sets and functions in nonconvex case (Q2045187) (← links)
• Sparse optimization on measures with over-parameterized gradient descent (Q2149558) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Gradient projection method on matrix manifolds (Q2208495) (← links)
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
• Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
• The local convexity of solving systems of quadratic equations (Q2410810) (← links)
• An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (Q5131960) (← links)
• (Q5214263) (← links)
• Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning (Q5214402) (← links)
• Orientation estimation of cryo-EM images using projected gradient descent method (Q5885761) (← links)
• Finding stationary points on bounded-rank matrices: a geometric hurdle and a smooth remedy (Q6038660) (← links)
• High-Dimensional Cost-constrained Regression Via Nonconvex Optimization (Q6631045) (← links)