Complexity guarantees and polling strategies for Riemannian direct-search methods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cavarretta, Bastien, Goyens, Florentin, Royer, Clément W., Yger, Florian
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

The Riemannian Landing Method: From projected gradient flows to SQP
by: Goyens, Florentin, et al.
Published: (2026)

Registration of algebraic varieties using Riemannian optimization
by: Goyens, Florentin, et al.
Published: (2024)

Direct-search methods in the year 2025: Theoretical guarantees and algorithmic paradigms
by: Dzahini, K. J., et al.
Published: (2024)

Geometric design of the tangent term in landing algorithms for orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2025)

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

Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
by: Goyens, Florentin, et al.
Published: (2022)

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

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

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

The sketched landing method for large-scale optimization under orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2026)

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

Convergence towards a local minimum by direct search methods with a covering step
by: Audet, Charles, et al.
Published: (2024)

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

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

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
by: Sato, Hiroyuki, et al.
Published: (2023)

Efficient search strategies for constrained multiobjective blackbox optimization
by: Digabel, Sébastien Le, et al.
Published: (2025)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
by: Xu, Meng, et al.
Published: (2024)

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

Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions
by: Okuno, Takayuki
Published: (2020)

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

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

Riemannian conditional gradient methods for composite optimization problems
by: Chen, Kangming, et al.
Published: (2024)

An increasing rank Riemannian method for generalized Lyapunov equations
by: Huang, Zhenwei, et al.
Published: (2023)

Importance sampling-based gradient method for dimension reduction in Poisson log-normal model
by: Batardière, Bastien, et al.
Published: (2024)

Local near-quadratic convergence of Riemannian interior point methods
by: Obara, Mitsuaki, et al.
Published: (2025)

Using orthogonally structured positive bases for constructing positive $k$-spanning sets with cosine measure guarantees
by: Hare, Warren, et al.
Published: (2023)

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

Adaptive Riemannian ADMM for Nonsmooth Optimization: Optimal Complexity without Smoothing
by: Deng, Kangkang, et al.
Published: (2025)

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

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

Riemannian Accelerated Zeroth-order Algorithm: Improved Robustness and Lower Query Complexity
by: He, Chang, et al.
Published: (2024)

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

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

Second-order geometry and Riemannian Newton's method for optimization on the indefinite Stiefel manifold
by: Sato, Hiroyuki
Published: (2026)

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

Generalized Hukuhara directional differentiability of interval-valued functions on Riemannian manifolds
by: Bhat, Hilal Ahmad, et al.
Published: (2022)

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

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