Active set identification for linearly constrained minimization without explicit derivatives
From MaRDI portal
Recommendations
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- New active set identification for general constrained optimization and minimax problems
- On the accurate identification of active set for constrained minimax problems
- Active Set Identification in Nonlinear Programming
- Stationarity Results for Generating Set Search for Linearly Constrained Optimization
Cited in
(9)- A progressive barrier derivative-free trust-region algorithm for constrained optimization
- Linear equalities in blackbox optimization
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- Implementing Generating Set Search Methods for Linearly Constrained Minimization
- A Derivative-Free Method for Structured Optimization Problems
- Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
- A derivative-free algorithm for non-linear optimization with linear equality constraints
- New active set identification for general constrained optimization and minimax problems
This page was built for publication: Active set identification for linearly constrained minimization without explicit derivatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586140)