Imagen de Portada

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Lauga, Guillaume
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A flexible block-coordinate forward-backward algorithm for non-smooth and non-convex optimization
por: Briceño-Arias, Luis, et al.
Publicado: (2025)

Riemannian coordinate descent algorithms on matrix manifolds
por: Han, Andi, et al.
Publicado: (2024)

Proximal basin hopping: global optimization with guarantees
por: Lauga, Guillaume, et al.
Publicado: (2026)

Scalable iterative pruning of large language and vision models using block coordinate descent
por: Rosenberg, Gili, et al.
Publicado: (2024)

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

Gradient descent in matrix factorization: Understanding large initialization
por: Chen, Hengchao, et al.
Publicado: (2023)

The Mixing method: low-rank coordinate descent for semidefinite programming with diagonal constraints
por: Wang, Po-Wei, et al.
Publicado: (2017)

A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity
por: Davis, Damek, et al.
Publicado: (2026)

Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
por: Li, Yuchen, et al.
Publicado: (2023)

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

An inexact LPA for DC composite optimization and application to matrix completions with outliers
por: Tao, Ting, et al.
Publicado: (2023)

Fast sparse optimization via adaptive shrinkage
por: Cerone, Vito, et al.
Publicado: (2025)

Cubic regularized subspace Newton for non-convex optimization
por: Zhao, Jim, et al.
Publicado: (2024)

A simple uniformly optimal method without line search for convex optimization
por: Li, Tianjiao, et al.
Publicado: (2023)

Non-geodesically-convex optimization in the Wasserstein space
por: Luu, Hoang Phuc Hau, et al.
Publicado: (2024)

A multilevel approach to accelerate the training of Transformers
por: Lauga, Guillaume, et al.
Publicado: (2025)

A theoretical and empirical study of new adaptive algorithms with additional momentum steps and shifted updates for stochastic non-convex optimization
por: Alecsa, Cristian Daniel
Publicado: (2021)

Learning based convex approximation for constrained parametric optimization
por: Liu, Kang, et al.
Publicado: (2025)

Nesterov acceleration in benignly non-convex landscapes
por: Gupta, Kanan, et al.
Publicado: (2024)

Manifold constrained steepest descent
por: Yang, Kaiwei, et al.
Publicado: (2026)

Instance-optimal stochastic convex optimization: Can we improve upon sample-average and robust stochastic approximation?
por: Jiang, Liwei, et al.
Publicado: (2026)

Conditional simulation via entropic optimal transport: Toward non-parametric estimation of conditional Brenier maps
por: Baptista, Ricardo, et al.
Publicado: (2024)

Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks
por: Jentzen, Arnulf, et al.
Publicado: (2024)

Learning mirror maps in policy mirror descent
por: Alfano, Carlo, et al.
Publicado: (2024)

Gauss-Southwell type descent methods for low-rank matrix optimization
por: Olikier, Guillaume, et al.
Publicado: (2023)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
por: Zeng, Yun, et al.
Publicado: (2023)

Empirical and computer-aided robustness analysis of long-step and accelerated methods in smooth convex optimization
por: Vernimmen, Pierre, et al.
Publicado: (2025)

New logarithmic step size for stochastic gradient descent
por: Shamaee, M. Soheil, et al.
Publicado: (2024)

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms
por: Dagréou, Mathieu, et al.
Publicado: (2022)

Flattened one-bit stochastic gradient descent: compressed distributed optimization with controlled variance
por: Stollenwerk, Alexander, et al.
Publicado: (2024)

Iterative regularization in classification via hinge loss diagonal descent
por: Apidopoulos, Vassilis, et al.
Publicado: (2022)

Mitigating optimistic bias in entropic risk estimation and optimization
por: Sadana, Utsav, et al.
Publicado: (2024)

Non-convex entropic mean-field optimization via Best Response flow
por: Lascu, Razvan-Andrei, et al.
Publicado: (2025)

Introduction: Swarm-based gradient descent for non convex optimization
por: Tikko, Janina
Publicado: (2024)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
por: Lee, Ching-pei, et al.
Publicado: (2022)

On the global convergence of gradient descent for wide shallow models with bounded nonlinearities
por: Petit, Romain, et al.
Publicado: (2026)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
por: Ding, Kuangyu, et al.
Publicado: (2025)

The duality structure gradient descent algorithm: analysis and applications to neural networks
por: Flynn, Thomas
Publicado: (2017)

Bayesian optimization as a flexible and efficient design framework for sustainable process systems
por: Paulson, Joel A., et al.
Publicado: (2024)

Characterizations of inexact proximal operators
por: Lauga, Guillaume, et al.
Publicado: (2026)