On the optimal order of worst case complexity of direct search

DOI10.1007/s11590-015-0908-1zbMath1346.90764OpenAlexW2189378081WikidataQ58040503 ScholiaQ58040503MaRDI QIDQ276315

M. Dodangeh, Zaikun Zhang, Luis Nunes Vicente

Publication date: 3 May 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0908-1

zbMATH Keywords

direct searchworst case complexitycosine measureoptimal orderpositive spanning setsphere covering

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30)

Related Items

Efficient unconstrained black box optimization, Zeroth-order optimization with orthogonal random directions, Direct search based on probabilistic feasible descent for bound and linearly constrained problems, Direct Search Based on Probabilistic Descent in Reduced Spaces, A deterministic algorithm to compute the cosine measure of a finite positive spanning set, Quadratic regularization methods with finite-difference gradient approximations, Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization, On the properties of the cosine measure and the uniform angle subspace, Derivative-free optimization methods, Positive bases with maximal cosine measure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worst case complexity of direct search
• Gelfand numbers of operators with values in a Hilbert space
• The blocking numbers of convex bodies
• Approximation of zonoids by zonotopes
• On the distance of polytopes with few vertices to the Euclidean ball
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• On the Convergence of Pattern Search Algorithms
• Accelerated, Parallel, and Proximal Coordinate Descent
• Introduction to Derivative-Free Optimization
• EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
• Approximation of the Sphere by Polytopes having Few Vertices
• On the Local Convergence of Pattern Search
• Direct Search Based on Probabilistic Descent
• Worst case complexity of direct search under convexity