Worst case complexity bounds for linesearch-type derivative-free algorithms
type: Item
instance of: scholarly article
title: Worst case complexity bounds for linesearch-type derivative-free algorithms
author: Andrea Brilli
author: Morteza Kimiaei
author: Giampaolo Liuzzi
author: Stefano Lucidi
published in: Journal of Optimization Theory and Applications
publication date: 2024-11-12T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7942677
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: line search
zbMATH Keywords: worst case complexity
MaRDI profile type: Publication
cites work: On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates
cites work: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
cites work: Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives
cites work: Stochastic optimization using a trust-region method and random models
cites work: On the optimal order of worst case complexity of direct search
cites work: A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
cites work: Implementing the Nelder-Mead simplex algorithm with adaptive parameters
cites work: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
cites work: Stochastic derivative-free optimization using a trust region framework
cites work: A derivative-free algorithm for bound constrained optimization
cites work: On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: A Simplex Method for Function Minimization
cites work: On the Convergence of Pattern Search Algorithms
cites work: Worst case complexity of direct search
DOI: 10.1007/S10957-024-02519-X
description: scientific article; zbMATH DE number 7942677