Image de couverture de livre

The Randomized Block Coordinate Descent Method in the Hölder Smooth Setting

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Maia, Leandro Farias, Gutman, David Huckleberry
Format:	Preprint
Publié:	2024
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

An Invitation to Higher-Order Riemannian Optimization: Optimal and Implementable Methods
par: Gutman, David Huckleberry, et autres
Publié: (2026)

Block Decomposable Methods for Large-Scale Optimization Problems
par: Maia, Leandro Farias
Publié: (2026)

Block Coordinate Descent Network Simplex Methods for Optimal Transport
par: Li, Lingrui, et autres
Publié: (2025)

An Adaptive Proximal ADMM for Nonconvex Linearly Constrained Composite Programs
par: Maia, Leandro Farias, et autres
Publié: (2024)

Differentially Private Random Block Coordinate Descent
par: Maranjyan, Artavazd, et autres
Publié: (2024)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
par: Ren, Yijin, et autres
Publié: (2025)

Block Coordinate Descent Methods for Structured Nonconvex Optimization with Nonseparable Constraints: Optimality Conditions and Global Convergence
par: Yuan, Zhijie, et autres
Publié: (2024)

Decentralized Relaxed Smooth Optimization with Gradient Descent Methods
par: Jiang, Zhanhong, et autres
Publié: (2025)

Projected Block Coordinate Descent for sparse spike estimation
par: Bénard, Pierre-Jean, et autres
Publié: (2024)

Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent Optimization
par: Yu, Zhan, et autres
Publié: (2019)

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization
par: Wang, Zimeng, et autres
Publié: (2026)

An Inexact Weighted Proximal Trust-Region Method
par: Maia, Leandro Farias, et autres
Publié: (2026)

High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
par: Ye, Haishan
Publié: (2026)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
par: Yuan, Bowen, et autres
Publié: (2025)

Provably Convergent Plug-and-play Proximal Block Coordinate Descent Method for Hyperspectral Anomaly Detection
par: Liu, Xiaoxia, et autres
Publié: (2024)

A Randomized Block-Coordinate Primal-Dual Method for Large-scale Stochastic Saddle Point Problems
par: Hamedani, Erfan Yazdandoost, et autres
Publié: (2019)

Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
par: Kim, Donghwa, et autres
Publié: (2025)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
par: Yuan, Ganzhao
Publié: (2023)

Random Coordinate Descent on the Wasserstein Space of Probability Measures
par: Xu, Yewei, et autres
Publié: (2026)

A Partially Derivative-Free Proximal Method for Composite Multiobjective Optimization in the Hölder Setting
par: Amaral, V. S., et autres
Publié: (2025)

Gradient Descent for Convex and Smooth Noisy Optimization
par: Hu, Feifei, et autres
Publié: (2024)

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

Asynchronous Decentralized SGD under Non-Convexity: A Block-Coordinate Descent Framework
par: Zhou, Yijie, et autres
Publié: (2025)

A Mirror Descent Perspective of Smoothed Sign Descent
par: Wang, Shuyang, et autres
Publié: (2024)

Investigating Variance Definitions for Mirror Descent with Relative Smoothness
par: Hendrikx, Hadrien
Publié: (2024)

A Regularized Hessian-Free Inexact Newton-Type Method with Global $\mathcal{O}(k^{-2})$ Convergence
par: Maia, Leandro Farias, et autres
Publié: (2026)

Frictionless Hamiltonian Descent and Coordinate Hamiltonian Descent for Strongly Convex Quadratic Problems
par: Wang, Jun-Kun
Publié: (2024)

Gradient-Variation Online Adaptivity for Accelerated Optimization with Hölder Smoothness
par: Zhao, Yuheng, et autres
Publié: (2025)

Toward a Unified Theory of Gradient Descent under Generalized Smoothness
par: Tyurin, Alexander
Publié: (2024)

Asynchronous Distributed Reinforcement Learning for LQR Control via Zeroth-Order Block Coordinate Descent
par: Jing, Gangshan, et autres
Publié: (2021)

A Block Coordinate and Variance-Reduced Method for Generalized Variational Inequalities of Minty Type
par: Diakonikolas, Jelena
Publié: (2024)

Randomized Block Coordinate DC Programming
par: Maskan, Hoomaan, et autres
Publié: (2024)

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
par: Tran-Dinh, Quoc, et autres
Publié: (2023)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
par: Lobanov, Aleksandr, et autres
Publié: (2024)

Random Function Descent
par: Benning, Felix, et autres
Publié: (2023)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
par: Bai, Cedar Site, et autres
Publié: (2024)

A Sequential Descent Method for Global Optimization
par: Tifroute, Mohamed, et autres
Publié: (2020)

Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares
par: Peng, Liangzu, et autres
Publié: (2024)

Convergence of Steepest Descent and Adam under Non-Uniform Smoothness
par: Vaswani, Sharan, et autres
Publié: (2026)

Muon Converges under Heavy-Tailed Noise: Nonconvex Hölder-Smooth Empirical Risk Minimization
par: Iiduka, Hideaki
Publié: (2026)