New subspace method for unconstrained derivative-free optimization
From MaRDI portal
Publication:6604149
Cites work
- A derivative-free algorithm for bound constrained optimization
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- An efficient line search for nonlinear least squares
- Analysis of the BFGS Method with Errors
- 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
- 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 Noisy Functions via Quasi-Newton Methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Direct search based on probabilistic descent
- Efficient unconstrained black box optimization
- Estimating Computational Noise
- Exploiting Problem Structure in Derivative Free Optimization
- scientific article; zbMATH DE number 48629 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- LMBOPT: a limited memory method for bound-constrained optimization
- On the limited memory BFGS method for large scale optimization
- Optimization by Direct Search in Matrix Computations
- UOBYQA: unconstrained optimization by quadratic approximation
Cited in
(5)- Effective matrix adaptation strategy for noisy derivative-free optimization
- A new two-dimensional model-based subspace method for large-scale unconstrained derivative-free optimization: 2D-MoSub
- MATRS: heuristic methods for noisy derivative-free bound-constrained mixed-integer optimization
- The cosine measure relative to a subspace
- Quasi-Newton method with subspace gradients
This page was built for publication: New subspace method for unconstrained derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604149)
