Implementing Generating Set Search Methods for Linearly Constrained Minimization
DOI10.1137/050635432zbMATH Open1166.90368DBLPjournals/siamsc/LewisST07OpenAlexW2040751338WikidataQ60016552 ScholiaQ60016552MaRDI QIDQ3545257FDOQ3545257
Authors: Robert Michael Lewis, Anne Shepherd, Virginia J. Torczon 
Publication date: 10 December 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050635432
Recommendations
- Active set identification for linearly constrained minimization without explicit derivatives
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Asynchronous Parallel Generating Set Search for Linearly Constrained Optimization
- Generating set search methods for piecewise smooth problems
- Generalized pattern search methods for linearly equality constrained optimization problems
nonlinear programmingconstrained optimizationnonlinear optimizationdegeneracyderivative-free methodsdirect searchlinear constraintsgeneralized pattern searchgenerating set searchdouble description algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cited In (19)
- Avoiding bad steps in Frank-Wolfe variants
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Controlling variability in split-merge systems and its impact on performance
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Fully decoupled reliability-based design optimization of structural systems subject to uncertain loads
- Pattern search in the presence of degenerate linear constraints
- Linear equalities in blackbox optimization
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Active set identification for linearly constrained minimization without explicit derivatives
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
- A generating set search method using curvature information
Uses Software
This page was built for publication: Implementing Generating Set Search Methods for Linearly Constrained Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545257)
