Rates of Stability in Nonlinear Programming
From MaRDI portal
Cited in
(7)- Extensions of Radstrom's lemma with application to stability theory of mathematical programming
- Combinatorial behavior of extreme points of perturbed polyhedra
- Computable bounds on parametric solutions of convex problems
- A cutting-plane algorithm with linear and geometric rates of convergence
- On upper semicontinuity of global minima in constrained optimization problems
- Sensitivity and stability analysis for nonlinear programming
- Convexity and concavity properties of the optimal value function in parametric nonlinear programming
This page was built for publication: Rates of Stability in Nonlinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123100)