Pages that link to "Item:Q4620423"
From MaRDI portal
The following pages link to A Newton-Based Method for Nonconvex Optimization with Fast Evasion of Saddle Points (Q4620423):
Displaying 12 items.
- Regional complexity analysis of algorithms for nonconvex smooth optimization (Q2020615) (← links)
- Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
- Role of sparsity and structure in the optimization landscape of non-convex matrix sensing (Q2133410) (← links)
- Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization (Q2302838) (← links)
- Exploiting negative curvature in deterministic and stochastic optimization (Q2425164) (← 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)
- Classical algebraic geometry. Abstracts from the workshop held June 20--26, 2021 (hybrid meeting) (Q2693010) (← links)
- Accelerated Methods for NonConvex Optimization (Q4571877) (← links)
- Switched diffusion processes for non-convex optimization and saddle points search (Q6089196) (← links)
- A deterministic gradient-based approach to avoid saddle points (Q6622959) (← links)
- A systematic approach for learning imbalanced data: enhancing zero-inflated models through boosting (Q6655986) (← links)
