Cover Image

Gradient directions and relative inexactness in optimization and machine learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vasin, Artem
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

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
by: Vasin, Artem, et al.
Published: (2026)

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
by: Agafonov, Artem, et al.
Published: (2023)

A relative-error inexact ADMM splitting algorithm for convex optimization with inertial effects
by: Alves, M. Marques, et al.
Published: (2024)

An adaptively inexact first-order method for bilevel optimization with application to hyperparameter learning
by: Salehi, Mohammad Sadegh, et al.
Published: (2023)

Proximal gradient methods with inexact oracle of degree q for composite optimization
by: Nabou, Yassine, et al.
Published: (2024)

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

Learning to control inexact Benders decomposition via reinforcement learning
by: Li, Zhe, et al.
Published: (2025)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
by: Vasin, Artem, et al.
Published: (2025)

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

Characterizations of inexact proximal operators
by: Lauga, Guillaume, et al.
Published: (2026)

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

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
by: Bodard, Alexander, et al.
Published: (2024)

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

Convergence analysis of inexact MBA method for constrained upper-$\mathcal{C}^2$ optimization problems
by: Liu, Ruyu, et al.
Published: (2025)

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

An inexact inertial projective splitting algorithm with strong convergence
by: Alves, M. Marques, et al.
Published: (2025)

An inexact alternating projection method with application to matrix completion
by: Bellavia, Stefania, et al.
Published: (2025)

A general framework for inexact splitting algorithms with relative errors and applications to Chambolle-Pock and Davis-Yin methods
by: Alves, M. Marques, et al.
Published: (2024)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
by: Chen, Xiang, et al.
Published: (2024)

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

Enhancing finite-difference based derivative-free optimization methods with machine learning
by: Taminiau, Timothé, 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)

Curvature accelerated decentralized non-convex optimization for high-dimensional machine learning problems
by: Yi, Dingran, et al.
Published: (2025)

An augmented Lagrangian trust-region method with inexact gradient evaluations to accelerate constrained optimization problems using model hyperreduction
by: Wen, Tianshu, et al.
Published: (2024)

An inexact semismooth Newton-Krylov method for semilinear elliptic optimal control problem
by: Chen, Shiqi, et al.
Published: (2025)

An inexact golden ratio primal-dual algorithm with linesearch step for a saddle point problem
by: Fang, Changjie, et al.
Published: (2024)

An inexact primal-dual method with correction step for a saddle point problem in image debluring
by: Fang, Changjie, et al.
Published: (2021)

Alternating direction method of multipliers for polynomial optimization
by: Cerone, V., et al.
Published: (2025)

Common pitfalls to avoid while using multiobjective optimization in machine learning
by: Akhter, Junaid, et al.
Published: (2024)

A strongly convergent inertial inexact proximal-point algorithm for monotone inclusions with applications to variational inequalities
by: Alves, M. Marques, et al.
Published: (2024)

New second-order optimality conditions for directional optimality of a general set-constrained optimization problem
by: Ouyang, Wei, et al.
Published: (2024)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
by: Li, Shuyao, et al.
Published: (2023)

Adaptive directional decomposition methods for nonconvex constrained optimization
by: Shi, Qiankun, et al.
Published: (2025)

An intrusion detection system in internet of things using grasshopper optimization algorithm and machine learning algorithms
by: Sattarpour, Shiva, et al.
Published: (2025)

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

Gradient extremals, talwegs, valleys, and directional alignment for generic gradient descent
by: Bégout, Pascal, et al.
Published: (2026)

Co-optimization of spacecraft and low-thrust trajectory with direct methods
by: Saloglu, Keziban, et al.
Published: (2024)

Accelerated windowing for the crew rostering problem with machine learning
by: Racette, Philippe, et al.
Published: (2025)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
by: Bednarczuk, Ewa, et al.
Published: (2022)