Full-low evaluation methods for derivative-free optimization
From MaRDI portal
Cites work
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Analysis of direct searches for discontinuous functions
- Analysis of Generalized Pattern Searches
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- Conditioning of Quasi-Newton Methods for Function Minimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Derivative-free optimization of expensive functions with computational error using weighted regression
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Developments of NEWUOA for minimization without derivatives
- Direct search based on probabilistic descent
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Estimating Computational Noise
- Estimating derivatives of noisy simulations
- Function Minimization by Interpolation in a Data Table
- Geometry of interpolation sets in derivative free optimization
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- scientific article; zbMATH DE number 1301900 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 1552017 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Implicit filtering
- Incorporating minimum Frobenius norm models in direct search
- Introduction to Derivative-Free Optimization
- Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
- On the Convergence of Pattern Search Algorithms
- On the geometry phase in model-based algorithms for derivative-free optimization
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Optimization and nonsmooth analysis
- Order-based error for managing ensembles of surrogates in mesh adaptive direct search
- Random gradient-free minimization of convex functions
- Stochastic Estimation of the Maximum of a Regression Function
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Trust Region Methods
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Two decades of blackbox optimization applications
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Using Sampling and Simplex Derivatives in Pattern Search Methods
Cited in
(5)- Quadratic regularization methods with finite-difference gradient approximations
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization
- The limitation of neural nets for approximation and optimization
- On some Moser-type iterative methods with applications to nonlinear problems
- On an iterative Moser-Kurchatov method for solving systems of nonlinear equations
This page was built for publication: Full-low evaluation methods for derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882241)
