Copertina

Projected Block Coordinate Descent for sparse spike estimation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bénard, Pierre-Jean, Traonmilin, Yann, Aujol, Jean François
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Numerical Analysis Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

From sparse recovery to plug-and-play priors, understanding trade-offs for stable recovery with generalized projected gradient descent
di: Joundi, Ali, et al.
Pubblicazione: (2025)

A note on the convergence of RED algorithms under minimal hypotheses and open questions
di: Traonmilin, Yann, et al.
Pubblicazione: (2026)

Block Acceleration Without Momentum: On Optimal Stepsizes of Block Gradient Descent for Least-Squares
di: Peng, Liangzu, et al.
Pubblicazione: (2024)

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
di: Yuan, Ganzhao
Pubblicazione: (2023)

Low-Discrepancy Set Post-Processing via Gradient Descent
di: Clément, François, et al.
Pubblicazione: (2025)

Stochastic Adaptive Gradient Descent Without Descent
di: Aujol, Jean-François, et al.
Pubblicazione: (2025)

The Stochastic Steepest Descent Method for Robust Optimization in Banach Spaces
di: Chada, Neil K., et al.
Pubblicazione: (2023)

An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
di: Macedo, Humberto Gimenes, et al.
Pubblicazione: (2025)

IRKA is a Riemannian Gradient Descent Method
di: Mlinarić, Petar, et al.
Pubblicazione: (2023)

The Essential Best and Average Rate of Convergence of the Exact Line Search Gradient Descent Method
di: Yu, Thomas
Pubblicazione: (2023)

Parameter-free structure-texture image decomposition by unrolling
di: Girometti, Laura, et al.
Pubblicazione: (2025)

Polynomial argmin for recovery and approximation of multivariate discontinuous functions
di: Henrion, Didier, et al.
Pubblicazione: (2023)

Block Matrix and Tensor Randomized Kaczmarz Methods for Linear Feasibility Problems
di: Zhang, Minxin, et al.
Pubblicazione: (2024)

Wasserstein Steepest Descent Flows of Discrepancies with Riesz Kernels
di: Hertrich, Johannes, et al.
Pubblicazione: (2022)

Block triangular preconditioning for elliptic boundary optimal control with mixed boundary conditions
di: Wang, Chaojie
Pubblicazione: (2024)

Post-Processing with Projection and Rescaling Algorithms for Semidefinite Programming
di: Kanoh, Shin-ichi, et al.
Pubblicazione: (2024)

Approximate Projections onto the Positive Semidefinite Cone Using Randomization
di: Jones, Morgan, et al.
Pubblicazione: (2024)

Tight Convergence Rates in Gradient Mapping for the Difference-of-Convex Algorithm
di: Rotaru, Teodor, et al.
Pubblicazione: (2025)

Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
di: Li, Xinxin, et al.
Pubblicazione: (2026)

Differential estimates for fast first-order multilevel nonconvex optimisation
di: Dizon, Neil, et al.
Pubblicazione: (2024)

On a fixed-point continuation method for a convex optimization problem
di: Fest, Jean-Baptiste, et al.
Pubblicazione: (2022)

Numerical Analysis on Neural Network Projected Schemes for Approximating One Dimensional Wasserstein Gradient Flows
di: Zuo, Xinzhe, et al.
Pubblicazione: (2024)

Provably Faster Gradient Descent via Long Steps
di: Grimmer, Benjamin
Pubblicazione: (2023)

From PDEs constrained optimization to controllability problems via time domain decomposition
di: Cocquet, Pierre-Henri, et al.
Pubblicazione: (2026)

On the optimization of discrepancy measures
di: Clément, François, et al.
Pubblicazione: (2025)

Inexact Projected Preconditioned Gradient Methods with Variable Metrics: General Convergence Theory via Lyapunov Approach
di: Guo, Ruchi, et al.
Pubblicazione: (2025)

Error estimates of $hp$-finite element method for elliptic optimal control problems with robin boundary
di: Lin, Xingyuan, et al.
Pubblicazione: (2026)

Super Gradient Descent: Global Optimization requires Global Gradient
di: Achour, Seifeddine
Pubblicazione: (2024)

Multilevel Stochastic Gradient Descent for Optimal Control Under Uncertainty
di: Baumgarten, Niklas, et al.
Pubblicazione: (2025)

A non-intrusive neural-network based BFGS algorithm for parameter estimation in non-stationary elasticity
di: Frei, Stefan, et al.
Pubblicazione: (2023)

Numerical analysis of a nonsmooth quasilinear elliptic control problem: II. Finite element discretization and error estimates
di: Clason, Christian, et al.
Pubblicazione: (2023)

Gradient Descent as a Perceptron Algorithm: Understanding Dynamics and Implicit Acceleration
di: Tyurin, Alexander
Pubblicazione: (2025)

LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0
di: Gilbert, Jean Charles, et al.
Pubblicazione: (2007)

sparseGeoHOPCA: A Geometric Solution to Sparse Higher-Order PCA Without Covariance Estimation
di: Xu, Renjie, et al.
Pubblicazione: (2025)

Dual Cone Gradient Descent for Training Physics-Informed Neural Networks
di: Hwang, Youngsik, et al.
Pubblicazione: (2024)

Fast and Provable Tensor-Train Format Tensor Completion via Precondtioned Riemannian Gradient Descent
di: Bian, Fengmiao, et al.
Pubblicazione: (2025)

On the Convergence of the Gradient Descent Method with Stochastic Fixed-point Rounding Errors under the Polyak-Lojasiewicz Inequality
di: Xia, Lu, et al.
Pubblicazione: (2023)

The greedy side of the LASSO: New algorithms for weighted sparse recovery via loss function-based orthogonal matching pursuit
di: Mohammad-Taheri, Sina, et al.
Pubblicazione: (2023)

Worth Their Weight: Randomized and Regularized Block Kaczmarz Algorithms without Preprocessing
di: Goldshlager, Gil, et al.
Pubblicazione: (2025)

Gradient is All You Need? How Consensus-Based Optimization can be Interpreted as a Stochastic Relaxation of Gradient Descent
di: Riedl, Konstantin, et al.
Pubblicazione: (2023)