New subspace method for unconstrained derivative-free optimization
type: Item
instance of: scholarly article
title: New subspace method for unconstrained derivative-free optimization
DOI: 10.1145/3618297
author: Morteza Kimiaei
author: Arnold Neumaier
author: Parvaneh Faramarzi
published in: ACM Transactions on Mathematical Software
publication date: 2024-09-12T00:00:00Z
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7912537
zbMATH Keywords: unconstrained derivative-free optimization
zbMATH Keywords: subspace technique
zbMATH Keywords: line search approach
zbMATH Keywords: complexity
MaRDI profile type: MaRDI publication profile
cites work: An efficient line search for nonlinear least squares
cites work: Derivative-Free and Blackbox Optimization
cites work: Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
cites work: Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
cites work: Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
cites work: A theoretical and empirical comparison of gradient approximations in derivative-free optimization
cites work: Introduction to Derivative-Free Optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
cites work: Direct Search Based on Probabilistic Descent
cites work: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
cites work: Q3997500
cites work: Optimization by Direct Search in Matrix Computations
cites work: Q4237537
cites work: Efficient unconstrained black box optimization
cites work: LMBOPT: a limited memory method for bound-constrained optimization
cites work: Derivative-free optimization methods
cites work: Algorithm 909
cites work: On the limited memory BFGS method for large scale optimization
cites work: A derivative-free algorithm for bound constrained optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Estimating Computational Noise
cites work: Q5491447
cites work: Exploiting Problem Structure in Derivative Free Optimization
cites work: UOBYQA: unconstrained optimization by quadratic approximation
cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations
cites work: Adaptive Finite-Difference Interval Estimation for Noisy Derivative-Free Optimization
cites work: Analysis of the BFGS Method with Errors
description: scientific article; zbMATH DE number 7912537