A hybrid direct search and projected simplex gradient method for convex constrained minimization

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
Global convergence of trust-region algorithms for convex constrained minimization without derivatives
Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
Calibration of parameters in dynamic energy budget models using direct-search methods
The calculus of simplex gradients
A particle swarm pattern search method for bound constrained global optimization
Geometry of interpolation sets in derivative free optimization
Mixed variable optimization of a load-bearing thermal insulation system using a filter pattern search algorithm
Optimal aeroacoustic shape design using the surrogate management framework
On the Convergence of Pattern Search Algorithms
Implicit Filtering
Using Sampling and Simplex Derivatives in Pattern Search Methods
Pattern search in the presence of degenerate linear constraints
Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
Using simplex gradients of nonsmooth functions in direct search methods
OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
Introduction to Derivative-Free Optimization
Optimization and nonsmooth analysis
Two-Point Step Size Gradient Methods
Analysis of Generalized Pattern Searches
Inexact spectral projected gradient methods on convex sets
Pattern Search Methods for Linearly Constrained Minimization
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
Derivative-Free and Blackbox Optimization
Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems
Pattern Search Algorithms for Bound Constrained Minimization
Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
Fortified-Descent Simplicial Search Method: A General Approach
Benchmarking Derivative-Free Optimization Algorithms
A Progressive Barrier for Derivative-Free Nonlinear Programming
On the Barzilai and Borwein choice of steplength for the gradient method
Algorithm 813
CUTEr and SifDec
Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
Mesh Adaptive Direct Search Algorithms for Constrained Optimization
Theory of Positive Linear Dependence
Two decades of blackbox optimization applications

This page was built for publication: A hybrid direct search and projected simplex gradient method for convex constrained minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640994)