An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
From MaRDI portal
Publication:6064035
DOI10.1007/s10898-022-01173-9OpenAlexW4296045518MaRDI QIDQ6064035
No author found.
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01173-9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Distributed stochastic subgradient projection algorithms for convex optimization
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Geometric algorithms and combinatorial optimization.
- Introductory lectures on convex optimization. A basic course.
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Proximal Splitting Methods in Signal Processing
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Monotone Operators and the Proximal Point Algorithm
- Survey of Bundle Methods for Nonsmooth Optimization
- The indefinite proximal point algorithms for maximal monotone operators
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Regularization and Variable Selection Via the Elastic Net
- Signal Recovery by Proximal Forward-Backward Splitting
This page was built for publication: An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization
