Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
From MaRDI portal
Cites work
- 10.1162/15324430260185628
- A Gauss-Newton method for convex composite optimization
- A randomized Kaczmarz algorithm with exponential convergence
- A Stochastic Approximation Method
- Acceleration of Stochastic Approximation by Averaging
- An optimal method for stochastic composite optimization
- Asymptotic and finite-sample properties of estimators based on stochastic gradients
- Asymptotic optimality in stochastic optimization
- Asymptotic Statistics
- Asymptotics in statistics. Some basic concepts.
- Bundle methods for regularized risk minimization
- Descent methods for composite nondifferentiable optimization problems
- Ergodic convergence of a stochastic proximal point algorithm
- Error bounds, quadratic growth, and linear convergence of proximal methods
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 47310 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Introductory lectures on convex optimization. A basic course.
- Learning without concentration
- Lectures on Stochastic Programming
- Local linear convergence for alternating and averaged nonconvex projections
- Monotone Operators and the Proximal Point Algorithm
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- On approximate solutions of infinite systems of linear inequalities
- On Projection Algorithms for Solving Convex Feasibility Problems
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Pegasos: primal estimated sub-gradient solver for SVM
- Randomized methods for linear constraints: convergence rates and conditioning
- Robust Stochastic Approximation Approach to Stochastic Programming
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- Stochastic model-based minimization of weakly convex functions
- Stochastic optimization problems with nondifferentiable cost functionals
- The Cutting-Plane Method for Solving Convex Programs
- The nonsmooth landscape of phase retrieval
Cited in
(36)- Stochastic proximal splitting algorithm for composite minimization
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
- Sub-linear convergence of a stochastic proximal iteration method in Hilbert space
- Self-adaptive inexact proximal point methods
- Stochastic quasi-Newton with line-search regularisation
- On the computation of equilibria in monotone and potential stochastic hierarchical games
- Ergodic convergence of a stochastic proximal point algorithm
- On optimal probabilities in stochastic coordinate descent methods
- scientific article; zbMATH DE number 7370566 (Why is no real title available?)
- scientific article; zbMATH DE number 7625168 (Why is no real title available?)
- SI-ADMM: A Stochastic Inexact ADMM Framework for Stochastic Convex Programs
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Hybrid SGD algorithms to solve stochastic composite optimization problems with application in sparse portfolio selection problems
- A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems
- Adaptive step size rules for stochastic optimization in large-scale learning
- Bellman filtering and smoothing for state-space models
- A semismooth Newton stochastic proximal point algorithm with variance reduction
- Variance reduction techniques for stochastic proximal point algorithms
- Efficient algorithms for implementing incremental proximal-point methods
- The stochastic proximal distance algorithm
- Stochastic optimization over proximally smooth sets
- Tracking nonstationary streaming data via exponentially weighted moving average stochastic gradient descent
- Elephant random walks with multiple extractions and general reinforcement functions
- High-dimensional scaling limits and fluctuations of online least-squares SGD with smooth covariance
- Revisiting subgradient method: complexity and convergence beyond Lipschitz continuity
- Counterexamples for noise models of stochastic gradients
- Augmented Lagrangian methods for time-varying constrained online convex optimization
- Nonlinear tomographic reconstruction via nonsmooth optimization
- Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness
- Statistical inference of constrained stochastic optimization via sketched sequential quadratic programming
- Implicit parameter-free online learning with truncated linear models
- Gradient descent for convex and smooth noisy optimization
- Revisiting stochastic proximal point methods: generalized smoothness and similarity
- Implicit score-driven filters for time-varying parameter models
- Optimal reinsurance and investment via stochastic projected gradient method based on Malliavin calculus
This page was built for publication: Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233106)
