An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization

DOI10.1007/S10898-022-01173-9MaRDI QIDQ6064035zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

nonsmooth optimizationsubgradientcomposite convex optimizationNesterov's dual averaging

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Inexact proximal stochastic gradient method for convex composite optimization
• A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems
• Adaptive smoothing algorithms for nonsmooth composite convex minimization
• A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
• An algorithm for composite nonsmooth optimization problems

Cites work

• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
• Adaptive subgradient methods for online learning and stochastic optimization
• Distributed stochastic subgradient projection algorithms for convex optimization
• Dual averaging methods for regularized stochastic learning and online optimization
• Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
• Geometric algorithms and combinatorial optimization.
• Incremental stochastic subgradient algorithms for convex optimization
• Introductory lectures on convex optimization. A basic course.
• Monotone Operators and the Proximal Point Algorithm
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
• Primal-dual subgradient methods for convex problems
• Proximal splitting methods in signal processing
• Regularization and Variable Selection Via the Elastic Net
• Signal Recovery by Proximal Forward-Backward Splitting
• Smooth minimization of non-smooth functions
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Survey of Bundle Methods for Nonsmooth Optimization
• The indefinite proximal point algorithms for maximal monotone operators

This page was built for publication: An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064035)