Full-low evaluation methods for bound and linearly constrained derivative-free optimization
From MaRDI portal
(Redirected from Publication:6624429)
Recommendations
- A derivative-free algorithm for bound constrained optimization
- Objective-derivative-free methods for constrained optimization
- Derivative-free optimization methods
- A DIRECT-type approach for derivative-free constrained global optimization
- On the numerical performance of finite-difference-based methods for derivative-free optimization
Cites work
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- A progressive barrier for derivative-free nonlinear programming
- A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
- A taxonomy of constraints in black-box simulation-based optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Analysis of direct searches for discontinuous functions
- Analysis of Generalized Pattern Searches
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Conditioning of Quasi-Newton Methods for Function Minimization
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Double description method revisited
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Full-low evaluation methods for derivative-free optimization
- Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points
- scientific article; zbMATH DE number 686746 (Why is no real title available?)
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonlinear programming
- On the Convergence of Pattern Search Algorithms
- On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
- On the numerical performance of finite-difference-based methods for derivative-free optimization
- Optimization and nonsmooth analysis
- Pattern Search Algorithms for Bound Constrained Minimization
- Pattern Search Methods for Linearly Constrained Minimization
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Trust Region Methods
- Two decades of blackbox optimization applications
This page was built for publication: Full-low evaluation methods for bound and linearly constrained derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6624429)
