Copertina

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gratton, Serge, Sim, Chee-Khian, Toint, Philippe L.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Computational Complexity 49M37, 65K05, 68Q17, 68W40, 90C30 F.2.1; G.1.6; I.1.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
di: Gratton, Serge, et al.
Pubblicazione: (2026)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
di: Gratton, Serge, et al.
Pubblicazione: (2024)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
di: Bellavia, S., et al.
Pubblicazione: (2025)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
di: Toint, Philippe L.
Pubblicazione: (2024)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
di: Gratton, Serge, et al.
Pubblicazione: (2025)

Incremental-Decremental Maximization
di: Disser, Yann, et al.
Pubblicazione: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

Advances in Quantum Genetic Algorithms
di: Lima, Dennis, et al.
Pubblicazione: (2025)

Efficient Binary Decision Diagram Manipulation in External Memory
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2021)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
di: Kumar, Mrinal, et al.
Pubblicazione: (2018)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
di: Mundhra, S.
Pubblicazione: (2025)

Recent Developments in Real Quantifier Elimination and Cylindrical Algebraic Decomposition
di: England, Matthew
Pubblicazione: (2024)

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
di: Anagnostopoulos, Theodoros, et al.
Pubblicazione: (2026)

STRIDE: A Self-Reflective Agent Framework for Reliable Automatic Equation Discovery
di: Su, Jiarui, et al.
Pubblicazione: (2026)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2023)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
di: Rahat, Md Tanzeem, et al.
Pubblicazione: (2025)

A Novel Discrete-time Model of Information Diffusion on Social Networks Considering Users Behavior
di: Van Khanh, Tran, et al.
Pubblicazione: (2025)

FePySR: A Neural Feature Extraction Framework for Efficient and Scalable Symbolic Regression
di: Yu, Zhiming, et al.
Pubblicazione: (2026)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Decidability of membership problems for flat rational subsets of $\mathrm{GL}(2,\mathbb{Q})$ and singular matrices
di: Diekert, Volker, et al.
Pubblicazione: (2019)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2024)

An innovative data collection method to eliminate the preprocessing phase in web usage mining
di: Canay, Ozkan, et al.
Pubblicazione: (2025)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
di: Cicirello, Vincent A.
Pubblicazione: (2017)

Algorithms for Generating Small Random Samples
di: Cicirello, Vincent A.
Pubblicazione: (2024)

An optimally fast objective-function-free minimization algorithm using random subspaces
di: Bellavia, S., et al.
Pubblicazione: (2023)

$(1+\varepsilon)$-ANN Data Structure for Curves via Subspaces of Bounded Doubling Dimension
di: Conradi, Jacobus, et al.
Pubblicazione: (2023)

Learning Rate Engineering: From Coarse Single Parameter to Layered Evolution
di: Yao, Ming-Hong, et al.
Pubblicazione: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
di: Hougardy, Stefan, et al.
Pubblicazione: (2024)

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification
di: Drechsler, Rolf
Pubblicazione: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
di: Feldman, Moran, et al.
Pubblicazione: (2026)

Symbolic Model Checking in External Memory
di: Sølvsten, Steffan Christ, et al.
Pubblicazione: (2025)

NeurOptimisation: The Spiking Way to Evolve
di: Cruz-Duarte, Jorge Mario, et al.
Pubblicazione: (2025)

Prediction-space knowledge markets for communication-efficient federated learning on multimedia tasks
di: Du, Wenzhang
Pubblicazione: (2025)

Introducing the Quantum Economic Advantage Online Calculator
di: Mejia, Frederick, et al.
Pubblicazione: (2025)

Competitive Data-Structure Dynamization
di: Mathieu, Claire, et al.
Pubblicazione: (2020)

The Li-Chao Tree: Algorithm Specification and Analysis
di: Li, Chao
Pubblicazione: (2026)