Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dzahini, K. J., Rinaldi, F., Royer, C. W., Zeffiro, D.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Direct search for stochastic optimization in random subspaces with zeroth-, first-, and second-order convergence and expected complexity
di: Dzahini, K. J., et al.
Pubblicazione: (2024)

Complexity guarantees and polling strategies for Riemannian direct-search methods
di: Cavarretta, Bastien, et al.
Pubblicazione: (2025)

Riemannian trust-region methods for strict saddle functions with complexity guarantees
di: Goyens, Florentin, et al.
Pubblicazione: (2024)

Direct-search methods for decentralized blackbox optimization
di: Bergou, El Houcine, et al.
Pubblicazione: (2025)

Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses
di: Dzahini, Kwassi Joseph, et al.
Pubblicazione: (2022)

A line search framework with restarting for noisy optimization problems
di: Berahas, Albert S., et al.
Pubblicazione: (2025)

Complexity analysis of regularization methods for implicitly constrained least squares
di: Onwunta, Akwum, et al.
Pubblicazione: (2023)

Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints
di: Roberts, Lindon, et al.
Pubblicazione: (2026)

Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
di: Pischke, Nicholas, et al.
Pubblicazione: (2026)

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

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems
di: Nishijima, Mitsuhiro, et al.
Pubblicazione: (2025)

Efficient state transition algorithm with guaranteed optimality
di: Zhou, Xiaojun, et al.
Pubblicazione: (2025)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
di: Martin, Andrea, et al.
Pubblicazione: (2025)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
di: Chinchilla, Raphael, et al.
Pubblicazione: (2022)

Butterfly factorization with error guarantees
di: Le, Quoc-Tung, et al.
Pubblicazione: (2024)

Finite-sample guarantees for data-driven forward-backward operator methods
di: Fabiani, Filippo, et al.
Pubblicazione: (2025)

A Noise-Aware Scalable Subspace Classical Optimizer for the Quantum Approximate Optimization Algorithm
di: Dzahini, Kwassi Joseph, et al.
Pubblicazione: (2025)

Some iterative algorithms on Riemannian manifolds and Banach spaces with good global convergence guarantee
di: Truong, Tuyen Trung
Pubblicazione: (2025)

Performance guarantees for optimization-based state estimation using turnpike properties
di: Schiller, Julian D., et al.
Pubblicazione: (2025)

Full-Low Evaluation Methods For Bound and Linearly Constrained Derivative-Free Optimization
di: Royer, Clément W., et al.
Pubblicazione: (2023)

Koopman-based feedback design with stability guarantees
di: Strässer, Robin, et al.
Pubblicazione: (2023)

A hybrid local search algorithm for the Continuous Energy-Constrained Scheduling Problem
di: Brouwer, Roel, et al.
Pubblicazione: (2023)

A necessary condition for the guarantee of the superiorization method
di: Barshad, Kay, et al.
Pubblicazione: (2025)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
di: Maleknia, Morteza, et al.
Pubblicazione: (2024)

ITSO: A novel Inverse Transform Sampling-based Optimization algorithm for stochastic search
di: Bakas, Nikolaos P., et al.
Pubblicazione: (2019)

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
di: Fujiki, Kiwamu, et al.
Pubblicazione: (2025)

Regularization methods for solving hierarchical variational inequalities with complexity guarantees
di: Cortild, Daniel, et al.
Pubblicazione: (2025)

Conjugate gradient methods without line search for multiobjective optimization
di: Chen, Wang, et al.
Pubblicazione: (2023)

High-probability complexity guarantees for nonconvex minimax problems
di: Laguel, Yassine, et al.
Pubblicazione: (2024)

Koopman-based control of nonlinear systems with closed-loop guarantees
di: Strässer, Robin, et al.
Pubblicazione: (2024)

Convergence guarantees for adaptive model predictive control with kinky inference
di: Zuliani, Riccardo, et al.
Pubblicazione: (2023)

Complexity guarantees for risk-neutral generalized Nash equilibrium problems
di: Tao, Haochen, et al.
Pubblicazione: (2025)

Average consensus with resilience and privacy guarantees without losing accuracy
di: Ramos, Guilherme, et al.
Pubblicazione: (2025)

Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
di: Papageorgiou, Dimitri J., et al.
Pubblicazione: (2025)

Adaptive Economic Model Predictive Control for linear systems with performance guarantees
di: Degner, Maximilian, et al.
Pubblicazione: (2024)

An overview of systems-theoretic guarantees in data-driven model predictive control
di: Berberich, Julian, et al.
Pubblicazione: (2024)

Performance guaranteed MPC Policy Approximation via Cost Guided Learning
di: Zhou, Chenchen, et al.
Pubblicazione: (2026)

Control of bilinear systems using gain-scheduling: Stability and performance guarantees
di: Strässer, Robin, et al.
Pubblicazione: (2023)

Semi-definite programs for online control of nonlinear systems with stability guarantees
di: Dai, Xiaoyan
Pubblicazione: (2026)

Sharp recovery and landscape guarantees for the nonconvex matrix LASSO
di: McRae, Andrew D., et al.
Pubblicazione: (2026)