Exploiting Problem Structure in Derivative Free Optimization
From MaRDI portal
Publication:5066599
DOI10.1145/3474054OpenAlexW3120768405WikidataQ113309866 ScholiaQ113309866MaRDI QIDQ5066599
Margherita Porcelli, Phillipe 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel coordinate descent methods for big data optimization
- Incorporating minimum Frobenius norm models in direct search
- Mesh adaptive direct search algorithms for mixed variable optimization
- Trust-region and other regularisations of linear least-squares problems
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
- Exploiting band structure in unconstrained optimization without derivatives
- An algorithmic framework based on primitive directions and nonmonotone line searches for black-box optimization problems with integer variables
- A derivative-free Gauss-Newton method
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Coordinate descent algorithms
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Geometry of interpolation sets in derivative free optimization
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- Pattern Search Algorithms for Mixed Variable Programming
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- Convergence of the Restricted Nelder--Mead Algorithm in Two Dimensions
- Algorithm 909
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- On the Convergence of Pattern Search Algorithms
- Computing a Trust Region Step
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Introduction to Derivative-Free Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- `` Direct Search Solution of Numerical and Statistical Problems
- Direct Search Methods on Parallel Machines
- On the Convergence of the Multidirectional Search Algorithm
- On the Local Convergence of Pattern Search
- Trust Region Methods
- Pattern Search Methods for Linearly Constrained Minimization
- BFO, A Trainable Derivative-free Brute Force Optimizer for Nonlinear Bound-constrained Optimization and Equilibrium Computations with Continuous and Discrete Variables
- Derivative-Free and Blackbox Optimization
- The Mesh Adaptive Direct Search Algorithm for Granular and Discrete Variables
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers
- Function Minimization by Interpolation in a Data Table
- Benchmarking Derivative-Free Optimization Algorithms
- Derivative-free optimization methods
- A Note on Using Performance and Data Profiles for Training Algorithms
- Optimality Measures for Performance Profiles
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Direct Search Based on Probabilistic Descent
- A Simplex Method for Function Minimization
- Optimizing partially separable functions without derivatives
- Frame based methods for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Positive bases in numerical optimization
