:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bénard, Pierre-Jean, Traonmilin, Yann, Aujol, Jean François
Format:	Preprint
Published:	2024
Subjects:	Numerical Analysis Optimization and Control
Online Access:	https://arxiv.org/abs/2402.12021
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Provably Faster Gradient Descent via Long Steps
by: Grimmer, Benjamin
Published: (2023)

Super Gradient Descent: Global Optimization requires Global Gradient
by: Achour, Seifeddine
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Modified Loss of Momentum Gradient Descent: Fine-Grained Analysis
by: Cattaneo, Matias D., et al.
Published: (2025)

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

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