Cover Image

Proximal gradient methods with inexact oracle of degree q for composite optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nabou, Yassine, Glineur, Francois, Necoara, Ion
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Nonmonotone higher-order Taylor approximation methods for composite problems
by: Nabou, Yassine
Published: (2025)

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

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

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

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

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

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

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

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

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

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

Coordinate descent methods beyond smoothness and separability
by: Chorobura, Flavia, et al.
Published: (2024)

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

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
by: Liu, Ruyu, et al.
Published: (2023)

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

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

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

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

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

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

Convex semi-infinite programming algorithms with inexact separation oracles
by: Oustry, Antoine, et al.
Published: (2023)

Dual first-order methods for efficient computation of convex hull prices
by: Tanji, Sofiane, et al.
Published: (2025)

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

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

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

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

Exact Convergence rate of the subgradient method by using Polyak step size
by: Zamani, Moslem, et al.
Published: (2024)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

An inexact variable metric proximal linearization method for composite optimization on manifolds
by: He, Hao, et al.
Published: (2025)

A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
by: Liu, Zexian
Published: (2026)

Dynamic inverse problems: Online regularisation theory
by: Jauhiainen, Jyrki, et al.
Published: (2026)

Exact worst-case convergence rates of gradient descent: a complete analysis for all constant stepsizes over nonconvex and convex functions
by: Rotaru, Teodor, et al.
Published: (2024)

Numerical Design of Optimized First-Order Algorithms
by: Kamri, Yassine, et al.
Published: (2025)

Comparison of Proximal First-Order Primal and Primal-Dual algorithms via Performance Estimation
by: Bousselmi, Nizar, et al.
Published: (2024)

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

Global minimization of a minimum of a finite collection of functions
by: Van Dessel, Guillaume, et al.
Published: (2024)