Image de couverture de livre

Random coordinate descent methods for nonseparable composite optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chorobura, Flavia, Necoara, Ion
Format:	Preprint
Publié:	2022
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
par: Necoara, I., et autres
Publié: (2021)

Coordinate descent methods beyond smoothness and separability
par: Chorobura, Flavia, et autres
Publié: (2024)

Coordinate projected gradient descent minimization and its application to orthogonal nonnegative matrix factorization
par: Chorobura, Flavia, et autres
Publié: (2025)

An adaptive forward-backward-forward splitting algorithm for solving pseudo-monotone inclusions
par: Chorobura, Flavia, et autres
Publié: (2025)

Proximal gradient methods with inexact oracle of degree q for composite optimization
par: Nabou, Yassine, et autres
Publié: (2024)

Higher-order tensor methods for minimizing difference of convex functions
par: Necoara, Ion
Publié: (2024)

Stochastic subgradient for composite optimization with functional constraints
par: Necoara, Ion, et autres
Publié: (2022)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
par: Singh, Nitesh Kumar, et autres
Publié: (2024)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2025)

Random minibatch subgradient algorithms for convex problems with functional constraints
par: Nedich, Angelia, et autres
Publié: (2019)

A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
par: Necoara, Ion, et autres
Publié: (2020)

Regularized higher-order Taylor approximation methods for nonlinear least-squares
par: Nabou, Yassine, et autres
Publié: (2025)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
par: Nabou, Yassine, et autres
Publié: (2024)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2024)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2025)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
par: Singh, Nitesh Kumar, et autres
Publié: (2025)

A stochastic moving ball approximation method for smooth convex constrained minimization
par: Singh, Nitesh Kumar, et autres
Publié: (2024)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2023)

Mini-batch stochastic subgradient for functional constrained optimization
par: Singh, Nitesh Kumar, et autres
Publié: (2024)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
par: Nabou, Yassine, et autres
Publié: (2025)

Modified projected Gauss-Newton method for constrained nonlinear least-squares: application to power flow analysis
par: Nabou, Yassine, et autres
Publié: (2025)

Convergence analysis of stochastic higher-order majorization-minimization algorithms
par: Lupu, Daniela, et autres
Publié: (2021)

Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
par: Lupu, Daniela, et autres
Publié: (2024)

Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
par: Ding, Zhiyan, et autres
Publié: (2023)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
par: Tondji, Lionel, et autres
Publié: (2025)

Efficiency of higher-order algorithms for minimizing composite functions
par: Nabou, Yassine, et autres
Publié: (2022)

Interpolation-based coordinate descent method for parameterized quantum circuits
par: Lai, Zhijian, et autres
Publié: (2025)

Mirror descent method for stochastic multi-objective optimization
par: Yang, Linxi, et autres
Publié: (2024)

Improvements to steepest descent method for multi-objective optimization
par: Chen, Wang, et autres
Publié: (2023)

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2025)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
par: Lauga, Guillaume
Publié: (2026)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
par: Wang, Po-Wei, et autres
Publié: (2017)

A monotone block coordinate descent method for solving absolute value equations
par: Luo, Tingting, et autres
Publié: (2024)

Alternatives with stronger convergence than coordinate-descent iterative LMI algorithms
par: Simon, Emile, et autres
Publié: (2011)

A global Barzilai and Borwein's gradient normalization descent method for multiobjective optimization
par: Yang, Yingxue
Publié: (2024)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
par: Zeng, Yun, et autres
Publié: (2023)

Riemannian coordinate descent algorithms on matrix manifolds
par: Han, Andi, et autres
Publié: (2024)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
par: Kamri, Yassine, et autres
Publié: (2025)

A consensus-based optimization method for nonsmooth nonconvex programs with approximated gradient descent scheme
par: Wei, Jiazhen, et autres
Publié: (2025)

An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization
par: Jin, Jiachen, et autres
Publié: (2025)