Cover Image

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Necoara, I., Chorobura, F.
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Random coordinate descent methods for nonseparable composite optimization
by: Chorobura, Flavia, et al.
Published: (2022)

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

Coordinate projected gradient descent minimization and its application to orthogonal nonnegative matrix factorization
by: Chorobura, Flavia, et al.
Published: (2025)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

An adaptive forward-backward-forward splitting algorithm for solving pseudo-monotone inclusions
by: Chorobura, Flavia, et al.
Published: (2025)

Mini-batch stochastic subgradient for functional constrained optimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

A stochastic moving ball approximation method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Stochastic subgradient for composite optimization with functional constraints
by: Necoara, Ion, et al.
Published: (2022)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Integral control of the proximal gradient method for unbiased sparse optimization
by: Cerone, V., et al.
Published: (2025)

Higher-order tensor methods for minimizing difference of convex functions
by: Necoara, Ion
Published: (2024)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Convergence analysis of stochastic higher-order majorization-minimization algorithms
by: Lupu, Daniela, et al.
Published: (2021)

On the complexity of proximal gradient and proximal gradient-Newton-CG methods for \(\ell_1\)-regularized Optimization
by: Zhu, Hong
Published: (2025)

A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
by: Necoara, Ion, et al.
Published: (2020)

A stochastic gradient method for trilevel optimization
by: Giovannelli, Tommaso, et al.
Published: (2025)

Regularized higher-order Taylor approximation methods for nonlinear least-squares
by: Nabou, Yassine, et al.
Published: (2025)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
by: Nabou, Yassine, et al.
Published: (2024)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2024)

An inexact variable metric proximal linearization method for composite optimization on manifolds
by: He, Hao, et al.
Published: (2025)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Unifying restart accelerated gradient and proximal bundle methods
by: Liang, Jiaming
Published: (2025)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
by: Dao, Minh N., et al.
Published: (2025)

Two-norm discrepancy and convergence of the stochastic gradient method with application to shape optimization
by: Dambrine, Marc, et al.
Published: (2024)

Riemannian conditional gradient methods for composite optimization problems
by: Chen, Kangming, et al.
Published: (2024)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

An accelerated proximal bundle method for convex optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Multi-cut stochastic approximation methods for solving stochastic convex composite optimization
by: Liang, Jiaming, et al.
Published: (2025)

A single-loop proximal-conditional-gradient penalty method
by: Zhang, Hao, et al.
Published: (2024)

Weak convergence of the stochastic proximal point method in metric spaces
by: Pischke, Nicholas
Published: (2026)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
by: Guigues, Vincent, et al.
Published: (2024)

Primal-dual proximal bundle and conditional gradient methods for convex problems
by: Liang, Jiaming
Published: (2024)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
by: Nabou, Yassine, et al.
Published: (2025)

Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis
by: Nabou, Yassine, et al.
Published: (2025)

Unregularized limit of stochastic gradient method for Wasserstein distributionally robust optimization
by: Le, Tam
Published: (2025)

Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
by: Monteiro, Renato D. C., et al.
Published: (2024)

An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2022)

A VMiPG method for composite optimization with nonsmooth term having no closed-form proximal mapping
by: Zhang, Taiwei, et al.
Published: (2023)