Copertina

On the Complexity of Lower-Order Implementations of Higher-Order Methods

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Doikov, Nikita, Grapiglia, Geovani Nunes
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Fully Adaptive Zeroth-Order Method for Minimizing Functions with Compressible Gradients
di: Grapiglia, Geovani Nunes, et al.
Pubblicazione: (2025)

A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization
di: Davar, Dânâ, et al.
Pubblicazione: (2025)

A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima
di: Aminifard, Zohreh, et al.
Pubblicazione: (2025)

Universal Reduced-Operator Method and High-Order Global Curvature Bounds
di: Doikov, Nikita, et al.
Pubblicazione: (2025)

TRFD: A derivative-free trust-region method based on finite differences for composite nonsmooth optimization
di: Davar, Dânâ, et al.
Pubblicazione: (2024)

Complexity of quadratic penalty methods with adaptive accuracy under a PL condition for the constraints
di: Goyens, Florentin, et al.
Pubblicazione: (2026)

Sub-sampled Trust-Region Methods with Deterministic Worst-Case Complexity Guarantees
di: Goncalves, Max L. N., et al.
Pubblicazione: (2025)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
di: Pinheiro, Maria Eduarda, et al.
Pubblicazione: (2024)

Enhancing finite-difference based derivative-free optimization methods with machine learning
di: Taminiau, Timothé, et al.
Pubblicazione: (2025)

Riemannian optimization with finite-difference gradient approximations
di: Taminiau, Timothé, et al.
Pubblicazione: (2026)

Complexity of Minimizing Regularized Convex Quadratic Functions
di: Thomsen, Daniel Berg, et al.
Pubblicazione: (2024)

A Riemannian AdaGrad-Norm Method
di: Bento, Glaydston de C., et al.
Pubblicazione: (2025)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
di: Birgin, Ernesto G., et al.
Pubblicazione: (2025)

Spectral Preconditioning for Gradient Methods on Graded Non-convex Functions
di: Doikov, Nikita, et al.
Pubblicazione: (2024)

An Invitation to Higher-Order Riemannian Optimization: Optimal and Implementable Methods
di: Gutman, David Huckleberry, et al.
Pubblicazione: (2026)

Unified Convergence Theory of Stochastic and Variance-Reduced Cubic Newton Methods
di: Chayti, El Mahdi, et al.
Pubblicazione: (2023)

Gradient-Normalized Smoothness for Optimization with Approximate Hessians
di: Semenov, Andrei, et al.
Pubblicazione: (2025)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
di: Wang, Nuozhou, et al.
Pubblicazione: (2023)

Improving Stochastic Cubic Newton with Momentum
di: Chayti, El Mahdi, et al.
Pubblicazione: (2024)

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

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
di: Koloskova, Anastasia, et al.
Pubblicazione: (2023)

An Error Analysis of Second Order Elliptic Optimal Control Problem via Hybrid Higher Order Methods
di: Mallik, Gouranga, et al.
Pubblicazione: (2025)

Higher-Order Newton Methods with Polynomial Work per Iteration
di: Ahmadi, Amir Ali, et al.
Pubblicazione: (2023)

Robustness of Delayed Higher Order Sliding Mode Control
di: Labbadi, Moussa, et al.
Pubblicazione: (2025)

On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
di: Kwon, Jeongyeol, et al.
Pubblicazione: (2024)

Higher Order Rigidity and Energy
di: Gortler, Steven J., et al.
Pubblicazione: (2025)

Improved Iteration Complexity in Black-Box Optimization Problems under Higher Order Smoothness Function Condition
di: Lobanov, Aleksandr
Pubblicazione: (2024)

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

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
di: Ji, Kaiyi
Pubblicazione: (2025)

Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms
di: Gu, Bin, et al.
Pubblicazione: (2024)

Obtaining Structural Network Controllability with Higher-Order Local Dynamics
di: Peruzzo, Marco, et al.
Pubblicazione: (2025)

First-Order Methods for Linear Programming
di: Lu, Haihao
Pubblicazione: (2024)

Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations
di: Agafonov, Artem, et al.
Pubblicazione: (2024)

GPU Implementation of Second-Order Linear and Nonlinear Programming Solvers
di: Montoison, Alexis, et al.
Pubblicazione: (2025)

A Sequential Cubic Programming Method with Second-Order Complexity Guarantees for Equality Constrained Optimization
di: Dimou, Nikos, et al.
Pubblicazione: (2026)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
di: Shen, Yiyang, et al.
Pubblicazione: (2026)

Convergence and Sample Complexity of First-Order Methods for Agnostic Reinforcement Learning
di: Sherman, Uri, et al.
Pubblicazione: (2025)

Rank One Completion for Higher Order Tensors
di: Zhang, Linghao, et al.
Pubblicazione: (2026)

Verification of First-Order Methods for Parametric Quadratic Optimization
di: Ranjan, Vinit, et al.
Pubblicazione: (2024)

Geometrization of Higher-Order Linear Control Laws for Attitude Control on $\mathsf{SO(3)}$
di: Aslam, Farooq, et al.
Pubblicazione: (2025)