New subspace method for unconstrained derivative-free optimization
From MaRDI portal
Publication:6604149
DOI10.1145/3618297MaRDI QIDQ6604149
Parvaneh Faramarzi, Morteza Kimiaei, Arnold Neumaier
Publication date: 12 September 2024
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- On the limited memory BFGS method for large scale optimization
- An efficient line search for nonlinear least squares
- UOBYQA: unconstrained optimization by quadratic approximation
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- LMBOPT: a limited memory method for bound-constrained optimization
- Efficient unconstrained black box optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Algorithm 909
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Estimating Computational Noise
- Introduction to Derivative-Free Optimization
- Derivative-Free and Blackbox Optimization
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Exploiting Problem Structure in Derivative Free Optimization
- Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Analysis of the BFGS Method with Errors
- Derivative-free optimization methods
- Optimization by Direct Search in Matrix Computations
- Direct Search Based on Probabilistic Descent
- Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
- Benchmarking optimization software with performance profiles.
- A derivative-free algorithm for bound constrained optimization
Related Items (1)
This page was built for publication: New subspace method for unconstrained derivative-free optimization