The stochastic proximal distance algorithm
From MaRDI portal
Publication:6657820
DOI10.1007/s11222-024-10524-3MaRDI QIDQ6657820
Publication date: 7 January 2025
Published in: Statistics and Computing (Search for Journal in Brave)
stochastic optimizationconstrained estimationmajorization-minimizationproximal methodsdistance penalization
Computational methods for problems pertaining to statistics (62-08) Numerical mathematical programming methods (65K05) Convex programming (90C25)
Cites Work
- Unnamed Item
- Distance majorization and its applications
- Incremental proximal methods for large scale convex optimization
- Convex analysis and nonlinear optimization. Theory and examples
- Asymptotic and finite-sample properties of estimators based on stochastic gradients
- An algorithmic approach to nonlinear analysis and optimization
- MM Optimization Algorithms
- Ergodic Convergence of a Stochastic Proximal Point Algorithm
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust Stochastic Approximation Approach to Stochastic Programming
- Monotone Operators and the Proximal Point Algorithm
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- The Proximal Robbins–Monro Method
- Regularized Matrix Regression
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
- On perturbed proximal gradient algorithms
- Proximal Distance Algorithms: Theory and Examples
- A Stochastic Approximation Method
- Variational methods for the solution of problems of equilibrium and vibrations
- A proximal distance algorithm for likelihood-based sparse covariance estimation
This page was built for publication: The stochastic proximal distance algorithm