Exploiting Problem Structure in Derivative Free Optimization
type: Item
instance of: scholarly article
title: Exploiting Problem Structure in Derivative Free Optimization
DOI: 10.1145/3474054
author: Margherita Porcelli
author: Philippe L. Toint
published in: ACM Transactions on Mathematical Software
publication date: 2022-03-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/2001.04801
Mathematics Subject Classification ID: 65-XX
zbMATH DE Number: 7500131
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: direct-search methods
zbMATH Keywords: structured problems
zbMATH Keywords: interpolation models
MaRDI profile type: Publication
OpenAlex ID: W3120768405
Wikidata QID: Q113309866
cites work: Mesh adaptive direct search algorithms for mixed variable optimization
cites work: Pattern search algorithms for mixed variable programming
cites work: Derivative-Free and Blackbox Optimization
cites work: The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
cites work: Q5806242
cites work: Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers
cites work: Trust-region and other regularisations of linear least-squares problems
cites work: A derivative-free Gauss-Newton method
cites work: Exploiting band structure in unconstrained optimization without derivatives
cites work: Optimizing partially separable functions without derivatives
cites work: Trust Region Methods
cites work: Q4421356
cites work: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
cites work: Geometry of interpolation sets in derivative free optimization
cites work: Introduction to Derivative-Free Optimization
cites work: Q4524222
cites work: Frame based methods for unconstrained optimization
cites work: On the convergence of grid-based methods for unconstrained optimization
cites work: Positive bases in numerical optimization
cites work: Incorporating minimum Frobenius norm models in direct search
cites work: Direct Search Methods on Parallel Machines
cites work: On the Local Convergence of Pattern Search
cites work: Benchmarking optimization software with performance profiles.
cites work: Optimality Measures for 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: A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: Convergence of the restricted Nelder-Mead algorithm in two dimensions
cites work: Derivative-free optimization methods
cites work: Algorithm 909
cites work: Pattern Search Methods for Linearly Constrained Minimization
cites work: An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
cites work: On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
cites work: Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
cites work: Computing a Trust Region Step
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: A Simplex Method for Function Minimization
cites work: BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables
cites work: A Note on Using Performance and Data Profiles for Training Algorithms
cites work: Q4308910
cites work: Q4215359
cites work: Exploiting problem structure in pattern search methods for unconstrained optimization
cites work: Parallel coordinate descent methods for big data optimization
cites work: A derivative-free trust-funnel method for equality-constrained nonlinear optimization
cites work: Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
cites work: Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
cites work: Q3914337
cites work: On the Convergence of the Multidirectional Search Algorithm
cites work: On the Convergence of Pattern Search Algorithms
cites work: Function Minimization by Interpolation in a Data Table
cites work: Coordinate descent algorithms
description: scientific article; zbMATH DE number 7500131