:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Roberts, Lindon, Royer, Clément W.
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2605.27814
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Model Construction for Convex-Constrained Derivative-Free Optimization
by: Roberts, Lindon
Published: (2024)

Introduction to Interpolation-Based Optimization
by: Roberts, Lindon
Published: (2025)

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

Randomized Subspace Derivative-Free Optimization with Quadratic Models and Second-Order Convergence
by: Cartis, Coralia, et al.
Published: (2024)

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

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

Black-box Optimization Algorithms for Regularized Least-squares Problems
by: Liu, Yanjun, et al.
Published: (2024)

Interpolation Constraints for Computing Worst-Case Bounds in Performance Estimation Problems
by: Rubbens, Anne, et al.
Published: (2023)

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

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

Projected proximal gradient trust-region algorithm for nonsmooth optimization
by: Dao, Minh N., et al.
Published: (2025)

Worst-Case Complexity of High-Order Algorithms for Pareto-Front Reconstruction
by: Cristofari, Andrea, et al.
Published: (2025)

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

Universal Architectures for the Learning of Polyhedral Norms and Convex Regularizers
by: Unser, Michael, et al.
Published: (2025)

Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
by: Gruntkowska, Kaja, et al.
Published: (2024)

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

Worst-Case Services and State-Based Scheduling
by: Xu, Yike, et al.
Published: (2021)

A Decision-Making Method in Polyhedral Convex Set Optimization
by: Löhne, Andreas
Published: (2024)

Marginal Analysis of Convex Optimization Problems with Set-Valued Inclusion Constraints
by: Uderzo, Amos
Published: (2024)

Convexification of a Separable Function over a Polyhedral Ground Set
by: Dey, Santanu S., et al.
Published: (2025)

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

SOC-ICNN: From Polyhedral to Conic Geometry for Learning Convex Surrogate Functions
by: Liu, Kang, et al.
Published: (2026)

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

Bilevel Learning with Inexact Stochastic Gradients
by: Salehi, Mohammad Sadegh, et al.
Published: (2024)

Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
by: Hildebrand, Robert, et al.
Published: (2024)

Monotonicity and Contraction on Polyhedral Cones
by: Jafarpour, Saber, et al.
Published: (2022)

What are Capra-Convex Sets?
by: Chancelier, Jean-Philippe, et al.
Published: (2025)

Systematic Constraint Formulation and Collision-Free Trajectory Planning Using Space-Time Graphs of Convex Sets
by: Osburn, Matthew D., et al.
Published: (2025)

Why is Normalization Preferred? A Worst-Case Complexity Theory for Stochastically Preconditioned SGD under Heavy-Tailed Noise
by: Fang, Yuchen, et al.
Published: (2026)

On Integral Linear Constraints on Convex Cones
by: Vladu, Emil, et al.
Published: (2026)

Polyhedral Control Design: Theory and Methods
by: Houska, Boris, et al.
Published: (2024)

Online Nonstochastic Control with Convex Safety Constraints
by: Jiang, Nanfei, et al.
Published: (2025)

Strong Convexity of Sets in Riemannian Manifolds
by: Scieur, Damien, et al.
Published: (2023)

Trajectory Optimization of Stochastic Systems under Chance Constraints via Set Erosion
by: Liu, Zishun, et al.
Published: (2025)

Approximate Information States for Worst-Case Control and Learning in Uncertain Systems
by: Dave, Aditya, et al.
Published: (2023)

Sum-Rate Maximization via Convex Optimization Using Subgradient Projections Onto Nonlinear Spectral Radius Constraint Sets
by: Kuroda, Hiroki, et al.
Published: (2026)

An Integrated Cyber-Physical Risk Assessment Framework for Worst-Case Attacks in Industrial Control Systems
by: Aftabi, Navid, et al.
Published: (2023)

Generalized Alternating Projections on Manifolds and Convex Sets
by: Fält, Mattias, et al.
Published: (2021)

Transforming the Challenge of Constructing Low-Discrepancy Point Sets into a Permutation Selection Problem
by: Clément, François, et al.
Published: (2024)

Convex Hulls of Reachable Sets
by: Lew, Thomas, et al.
Published: (2023)