Effective matrix adaptation strategy for noisy derivative-free optimization
From MaRDI portal
Publication:6645950
Recommendations
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Robust optimization of noisy blackbox problems using the mesh adaptive direct search algorithm
- Improving the flexibility and robustness of model-based derivative-free optimization solvers
- scientific article; zbMATH DE number 1795729
- scientific article; zbMATH DE number 2038813
Cites work
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 879773 (Why is no real title available?)
- A Nonmonotone Line Search Technique for Newton’s Method
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A derivative-free algorithm for bound constrained optimization
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A grid algorithm for bound constrained optimization of noisy functions
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- A new nonmonotone line-search trust-region approach for nonlinear systems
- A non-monotone pattern search approach for systems of nonlinear equations
- A nonmonotone trust-region-approach with nonmonotone adaptive radius for solving nonlinear systems
- A trust-region method using extended nonmonotone technique for unconstrained optimization
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- An efficient nonmonotone trust-region method for unconstrained optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Complexity and global rates of trust-region methods based on probabilistic models
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Derivative-free and blackbox optimization
- Derivative-free optimization 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
- Efficient unconstrained black box optimization
- Estimating derivatives of noisy simulations
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- New subspace method for unconstrained derivative-free optimization
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
- On the limited memory BFGS method for large scale optimization
- Optimization by Direct Search in Matrix Computations
- Remark on ``Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- UOBYQA: unconstrained optimization by quadratic approximation
This page was built for publication: Effective matrix adaptation strategy for noisy derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645950)
