Adaptive direct search algorithms for constrained optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Audet, Charles, Denorme, Théo, Diouane, Youssef, Digabel, Sébastien Le, Tribes, Christophe
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C30, 90C56, 49J52 G.1.6; G.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
by: Audet, Charles, et al.
Published: (2025)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
by: Audet, Charles, et al.
Published: (2026)

Fidelity and interruption control for expensive constrained multi-fidelity blackbox optimization
by: Alarie, Stéphane, et al.
Published: (2023)

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
by: Gebken, Bennet
Published: (2024)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
by: Leconte, Geoffroy, et al.
Published: (2024)

Lipschitz minimization and the Goldstein modulus
by: Kong, Siyu, et al.
Published: (2024)

Multi-fidelity constraints in blackbox optimization
by: Alarie, Stéphane, et al.
Published: (2026)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

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

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

Tilt stability of Ky-Fan $κ$-norm composite optimization
by: Liu, Yulan, et al.
Published: (2024)

A derivative-free trust-region approach for Low Order-Value Optimization problems
by: Schwertner, Anderson E., et al.
Published: (2025)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
by: Rando, Marco, et al.
Published: (2025)

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

Depth-first directional search for nonconvex optimization
by: Zhang, Yuxuan, et al.
Published: (2024)

Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent Distributions
by: Hikima, Yuya, et al.
Published: (2024)

A Structured Tour of Optimization with Finite Differences
by: Rando, Marco, et al.
Published: (2025)

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, et al.
Published: (2024)

Finding directional stationary points of DC programs
by: Thi, Hoai An Le, et al.
Published: (2026)

Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
by: Jeong, Juyoung, et al.
Published: (2024)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
by: Nozawa, Ryota, et al.
Published: (2024)

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

Hidden convexity, optimization, and algorithms on rotation matrices
by: Ramachandran, Akshay, et al.
Published: (2023)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

CBX: Python and Julia packages for consensus-based interacting particle methods
by: Bailo, Rafael, et al.
Published: (2024)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
by: Diouane, Youssef, et al.
Published: (2024)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
by: Morinaga, Daiki, et al.
Published: (2022)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

A penalty barrier framework for nonconvex constrained optimization
by: De Marchi, Alberto, et al.
Published: (2024)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
by: Quan, Vu Hong, et al.
Published: (2025)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

A trust-region funnel algorithm for gray-box optimization
by: Hameed, Gul, et al.
Published: (2025)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

A multiscale Consensus-Based algorithm for multi-level optimization
by: Herty, Michael, et al.
Published: (2024)