Exploiting Problem Structure in Derivative Free Optimization
From MaRDI portal
Publication:5066599
DOI10.1145/3474054OpenAlexW3120768405WikidataQ113309866 ScholiaQ113309866MaRDI QIDQ5066599FDOQ5066599
Authors: Margherita Porcelli, Philippe L. Toint
Publication date: 29 March 2022
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04801
Cites Work
- Computing a Trust Region Step
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- BFO, a trainable derivative-free brute force optimizer for nonlinear bound-constrained optimization and equilibrium computations with continuous and discrete variables
- `` Direct Search Solution of Numerical and Statistical Problems
- A Simplex Method for Function Minimization
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Trust Region Methods
- Parallel coordinate descent methods for big data optimization
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- On the Convergence of the Multidirectional Search Algorithm
- Trust-region and other regularisations of linear least-squares problems
- On the Convergence of Pattern Search Algorithms
- Introduction to Derivative-Free Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- On the Local Convergence of Pattern Search
- Direct search based on probabilistic descent
- Positive bases in numerical optimization
- Coordinate descent algorithms
- Title not available (Why is that?)
- Benchmarking Derivative-Free Optimization Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pattern Search Methods for Linearly Constrained Minimization
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Mesh adaptive direct search algorithms for mixed variable optimization
- Pattern search algorithms for mixed variable programming
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Geometry of interpolation sets in derivative free optimization
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Frame based methods for unconstrained optimization
- Incorporating minimum Frobenius norm models in direct search
- Function Minimization by Interpolation in a Data Table
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- Direct Search Methods on Parallel Machines
- Optimality Measures for Performance Profiles
- Exploiting band structure in unconstrained optimization without derivatives
- Optimizing partially separable functions without derivatives
- On the convergence of grid-based methods for unconstrained optimization
- A note on using performance and data profiles for training algorithms
- Derivative-free and blackbox optimization
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- Derivative-free optimization methods
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
- A derivative-free Gauss-Newton method
- Improving the flexibility and robustness of model-based derivative-free optimization solvers
Cited In (7)
- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- A Derivative-Free Method for Structured Optimization Problems
- Derivative-Free Optimization
- New subspace method for unconstrained derivative-free optimization
- Title not available (Why is that?)
- Derivative-free bound-constrained optimization for solving structured problems with surrogate models
- Title not available (Why is that?)
This page was built for publication: Exploiting Problem Structure in Derivative Free Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066599)