Pages that link to "Item:Q4978058"
From MaRDI portal
The following pages link to Finding approximate local minima faster than gradient descent (Q4978058):
Displaying 44 items.
- Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points (Q683332) (← links)
- The global optimization geometry of shallow linear neural networks (Q1988338) (← links)
- Minimizing uniformly convex functions by cubic regularization of Newton method (Q2032037) (← links)
- Adaptive regularization with cubics on manifolds (Q2039233) (← links)
- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems (Q2044484) (← links)
- Newton-type methods for non-convex optimization under inexact Hessian information (Q2205970) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Lower bounds for finding stationary points II: first-order methods (Q2220663) (← links)
- Second-order guarantees in centralized, federated and decentralized nonconvex optimization (Q2225211) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization (Q2297654) (← links)
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)
- Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
- Approximating the nearest stable discrete-time system (Q2419035) (← links)
- Cubic regularization methods with second-order complexity guarantee based on a new subproblem reformulation (Q2676160) (← links)
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization (Q3176355) (← links)
- (Q4558559) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points (Q4620423) (← links)
- (Q4637040) (← links)
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization (Q4641667) (← links)
- (Q4969167) (← links)
- Matrix completion and related problems via strong duality (Q4993268) (← links)
- One-dimensional system arising in stochastic gradient descent (Q5022277) (← links)
- Escaping Strict Saddle Points of the Moreau Envelope in Nonsmooth Optimization (Q5097019) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- Second-Order Guarantees of Distributed Gradient Algorithms (Q5131964) (← links)
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem (Q5148399) (← links)
- (Q5149016) (← links)
- A concise second-order complexity analysis for unconstrained optimization using high-order regularized models (Q5210739) (← links)
- (Q5214187) (← links)
- (Q5214226) (← links)
- Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step (Q5233102) (← links)
- (Q5381112) (← links)
- Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization (Q5853562) (← links)
- Stochastic proximal linear method for structured non-convex problems (Q5858986) (← links)
- Higher-Order Methods for Convex-Concave Min-Max Optimization and Monotone Variational Inequalities (Q5869812) (← links)
- A Newton-CG Based Barrier Method for Finding a Second-Order Stationary Point of Nonconvex Conic Optimization with Complexity Guarantees (Q6114780) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)
- Optimizing mean field spin glasses with external field (Q6186448) (← links)
- Parameter-free accelerated gradient descent for nonconvex minimization (Q6561381) (← links)
- A deterministic gradient-based approach to avoid saddle points (Q6622959) (← links)
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (Q6642793) (← links)
- Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)