Effective matrix adaptation strategy for noisy derivative-free optimization
type: Item
instance of: scholarly article
title: Effective matrix adaptation strategy for noisy derivative-free optimization
author: Morteza Kimiaei
author: Arnold Neumaier
published in: Mathematical Programming Computation
publication date: 2024-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 7951596
zbMATH Keywords: noisy derivative-free optimization
zbMATH Keywords: evolution strategy
zbMATH Keywords: heuristic optimization
zbMATH Keywords: stochastic optimization
MaRDI profile type: MaRDI publication profile
cites work: An efficient nonmonotone trust-region method for unconstrained optimization
cites work: A nonmonotone trust-region-approach with nonmonotone adaptive radius for solving nonlinear systems
cites work: A non-monotone pattern search approach for systems of nonlinear equations
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
cites work: Derivative-Free and Blackbox Optimization
cites work: Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets
cites work: Introduction to Derivative-Free Optimization
cites work: A derivative-free nonmonotone line-search technique for unconstrained optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: A grid algorithm for bound constrained optimization of noisy functions
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: Complexity and global rates of trust-region methods based on probabilistic models
cites work: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
cites work: Optimization by Direct Search in Matrix Computations
cites work: Q4237537
cites work: A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
cites work: Q5164969
cites work: Efficient unconstrained black box optimization
cites work: New subspace method for unconstrained derivative-free optimization
cites work: A new nonmonotone line-search trust-region approach for nonlinear systems
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: Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization”
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Estimating Derivatives of Noisy Simulations
cites work: UOBYQA: unconstrained optimization by quadratic approximation
cites work: Developments of NEWUOA for minimization without derivatives
cites work: Derivative-free optimization: a review of algorithms and comparison of software implementations
cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
cites work: ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
cites work: Q4878831
DOI: 10.1007/S12532-024-00261-Z
description: scientific article; zbMATH DE number 7951596