Pages that link to "Item:Q6158001"

The following pages link to On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization (Q6158001):

Displaying 13 items.

• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization (Q486721) (← links)
• A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921) (← links)
• Random gradient-free minimization of convex functions (Q2397749) (← links)
• Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162) (← links)
• First-order methods almost always avoid strict saddle points (Q2425175) (← links)
• Behavior of accelerated gradient methods near critical points of nonconvex functions (Q2425178) (← links)
• Global convergence analysis of sparse regular nonconvex optimization problems (Q3307901) (← links)
• Global rates of convergence for nonconvex optimization on manifolds (Q5113326) (← links)
• Uniform rank gradient, cost, and local-global convergence (Q5218237) (← links)
• On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods (Q5300539) (← links)
• (Q5486096) (← links)
• Sharp global convergence guarantees for iterative nonconvex optimization with random data (Q6046308) (← links)
• Switched diffusion processes for non-convex optimization and saddle points search (Q6089196) (← links)