Worst-case evaluation complexity of a derivative-free quadratic regularization method

DOI10.1007/s11590-023-01984-zOpenAlexW4319725422MaRDI QIDQ6181370

Geovani Nunes Grapiglia

Publication date: 22 January 2024

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

Full work available at URL: https://doi.org/10.1007/s11590-023-01984-z

zbMATH Keywords

derivative-free optimizationworst-case complexityblack-box optimizationZeroth-order optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lectures on convex optimization
• Worst case complexity of direct search
• A computational framework for derivative-free optimization of cardiovascular geometries
• Gradient-free aerodynamic shape optimization using Large Eddy Simulation
• Random gradient-free minimization of convex functions
• Cubic regularization of Newton method and its global performance
• Trust-Region Methods Without Using Derivatives: Worst Case Complexity and the NonSmooth Case
• Introduction to Derivative-Free Optimization
• Derivative-Free and Blackbox Optimization
• Stochastic Three Points Method for Unconstrained Smooth Minimization
• Benchmarking Derivative-Free Optimization Algorithms
• Derivative-free optimization methods
• Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
• Worst case complexity of direct search under convexity
• Quadratic regularization methods with finite-difference gradient approximations

This page was built for publication: Worst-case evaluation complexity of a derivative-free quadratic regularization method