Exploiting Problem Structure in Derivative Free Optimization
From MaRDI portal
Publication:5066599
Cites work
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 1215248 (Why is no real title available?)
- scientific article; zbMATH DE number 653035 (Why is no real title available?)
- scientific article; zbMATH DE number 1971709 (Why is no real title available?)
- scientific article; zbMATH DE number 1552017 (Why is no real title available?)
- scientific article; zbMATH DE number 3067118 (Why is no real title available?)
- A Simplex Method for Function Minimization
- A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations
- A derivative-free Gauss-Newton method
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- A note on using performance and data profiles for training algorithms
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- An active-set trust-region method for derivative-free nonlinear bound-constrained 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
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Computing a Trust Region Step
- Convergence of the restricted Nelder-Mead algorithm in two dimensions
- Coordinate descent algorithms
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Direct Search Methods on Parallel Machines
- Direct search based on probabilistic descent
- Exploiting band structure in unconstrained optimization without derivatives
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Frame based methods for unconstrained optimization
- Function Minimization by Interpolation in a Data Table
- Geometry of interpolation sets in derivative free optimization
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Improving the flexibility and robustness of model-based derivative-free optimization solvers
- Incorporating minimum Frobenius norm models in direct search
- Introduction to Derivative-Free Optimization
- Mesh adaptive direct search algorithms for mixed variable optimization
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- On the Convergence of Pattern Search Algorithms
- On the Convergence of the Multidirectional Search Algorithm
- On the Global Convergence of Derivative-Free Methods for Unconstrained Optimization
- On the Local Convergence of Pattern Search
- On the convergence of grid-based methods for unconstrained optimization
- Optimality Measures for Performance Profiles
- Optimizing partially separable functions without derivatives
- Parallel coordinate descent methods for big data optimization
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern search algorithms for mixed variable programming
- Positive bases in numerical optimization
- Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The mesh adaptive direct search algorithm for granular and discrete variables
- Trust Region Methods
- Trust-region and other regularisations of linear least-squares problems
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(8)- Finding Optimal Algorithmic Parameters Using Derivative‐Free Optimization
- A Derivative-Free Method for Structured Optimization Problems
- Derivative-Free Optimization
- scientific article; zbMATH DE number 6514307 (Why is no real title available?)
- New subspace method for unconstrained derivative-free optimization
- Derivative-free bound-constrained optimization for solving structured problems with surrogate models
- scientific article; zbMATH DE number 3920218 (Why is no real title available?)
- Exploiting problem structure in derivative free optimization
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)
