Stochastic optimization over proximally smooth sets
From MaRDI portal
Publication:6663114
DOI10.1137/20m1320225MaRDI QIDQ6663114
Dmitriy Drusvyatskiy, Zhan Shi, Damek Shea Davis
Publication date: 14 January 2025
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Stochastic programming (90C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- \(\varepsilon\)-subgradient algorithms for locally Lipschitz functions on Riemannian manifolds
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- Gradient methods for minimizing composite functions
- A simplified view of first order methods for optimization
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- A Riemannian subgradient algorithm for economic dispatch with valve-point effect
- A collection of nonsmooth Riemannian optimization problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- Preservation of Prox-Regularity of Sets with Applications to Constrained Optimization
- A Second Order Nonsmooth Variational Model for Restoring Manifold-Valued Images
- Calculus Without Derivatives
- A Riemannian Gradient Sampling Algorithm for Nonsmooth Optimization on Manifolds
- Penalty methods with stochastic approximation for stochastic nonlinear programming
- A Moving Balls Approximation Method for a Class of Smooth Constrained Minimization Problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Curvature Measures
- Metric regularity and subdifferential calculus
- Proximal Point Algorithm On Riemannian Manifolds
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Line Search Algorithms for Locally Lipschitz Functions on Riemannian Manifolds
- Stochastic Model-Based Minimization of Weakly Convex Functions
- Prox-regular functions in variational analysis
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
- Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds
- Composite optimization for robust rank one bilinear sensing
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Nonconvex Robust Low-Rank Matrix Recovery
- The importance of better models in stochastic optimization
- Gradient Projection and Conditional Gradient Methods for Constrained Nonconvex Minimization
- Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- The nonsmooth landscape of phase retrieval
- Stochastic algorithms with geometric step decay converge linearly on sharp functions
This page was built for publication: Stochastic optimization over proximally smooth sets