Imagen de Portada

Coordinate descent methods beyond smoothness and separability

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chorobura, Flavia, Necoara, Ion
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
por: Necoara, I., et al.
Publicado: (2021)

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

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

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

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

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

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

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

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

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

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

Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks
por: Lupu, Daniela, et al.
Publicado: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
por: Nedich, Angelia, et al.
Publicado: (2019)

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

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

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

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

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

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
por: Kamri, Yassine, et al.
Publicado: (2025)

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

Non-smooth stochastic gradient descent using smoothing functions
por: Giovannelli, Tommaso, et al.
Publicado: (2025)

Complexity of Linearized Perturbed Augmented Lagrangian Methods for Nonsmooth Nonconvex Optimization with Nonlinear Equality Constraints
por: Bourkhissi, Lahcen El, et al.
Publicado: (2025)

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
por: Ahookhosh, Masoud, et al.
Publicado: (2025)

An accelerated randomized Bregman-Kaczmarz method for strongly convex linearly constraint optimization
por: Tondji, Lionel, et al.
Publicado: (2025)

Proximal gradient descent on the smoothed duality gap to solve saddle point problems
por: Fercoq, Olivier
Publicado: (2025)

Efficiency of higher-order algorithms for minimizing composite functions
por: Nabou, Yassine, et al.
Publicado: (2022)

Worst-case convergence analysis of relatively inexact gradient descent on smooth convex functions
por: Vernimmen, Pierre, et al.
Publicado: (2025)

An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization
por: Jin, Jiachen, et al.
Publicado: (2025)

On the convergence analysis of the decentralized projected gradient descent method
por: Choi, Woocheol, et al.
Publicado: (2023)

Almost sure convergence of stochastic Hamiltonian descent methods
por: Williamson, Måns, et al.
Publicado: (2024)

Mirror descent method for stochastic multi-objective optimization
por: Yang, Linxi, et al.
Publicado: (2024)

Improvements to steepest descent method for multi-objective optimization
por: Chen, Wang, et al.
Publicado: (2023)

Global minimisation of nonconvex functions by generalising the mirror descent method
por: Millán, Reinier Díaz, et al.
Publicado: (2024)

Quasi-Newton method of Optimization is proved to be a steepest descent method under the ellipsoid norm
por: Li, Jiongcheng
Publicado: (2024)

Directional descent
por: Young, Andrew J.
Publicado: (2024)

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

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