Implementing Generating Set Search Methods for Linearly Constrained Minimization
From MaRDI portal
Publication:3545257
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
Cited in
(19)- Active set identification for linearly constrained minimization without explicit derivatives
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization
- Pattern search in the presence of degenerate linear constraints
- Controlling variability in split-merge systems and its impact on performance
- Asynchronous parallel hybrid optimization combining DIRECT and GSS
- A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- Direct search based on probabilistic feasible descent for bound and linearly constrained problems
- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Fully decoupled reliability-based design optimization of structural systems subject to uncertain loads
- Avoiding bad steps in Frank-Wolfe variants
- A generating set search method using curvature information
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Generating set search using simplex gradients for bound-constrained black-box optimization
- Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions
- Linear equalities in blackbox optimization
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)
