A feasible method for constrained derivative-free optimization
From MaRDI portal
Cites work
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- A numerical study of limited memory BFGS methods
- A trust region method for noisy unconstrained optimization
- A trust-region derivative-free algorithm for constrained optimization
- Benchmarking Derivative-Free Optimization Algorithms
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
- Derivative-free optimization methods
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Global convergence of trust-region algorithms for convex constrained minimization without derivatives
- scientific article; zbMATH DE number 653035 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Introduction to Derivative-Free Optimization
- Model-based derivative-free methods for convex-constrained optimization
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On fast trust region methods for quadratic models with linear constraints
- On the geometry phase in model-based algorithms for derivative-free optimization
- Structure-Aware Methods for Expensive Derivative-Free Nonsmooth Composite Optimization
- The NEWUOA software for unconstrained optimization without derivatives
This page was built for publication: A feasible method for constrained derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233034)
