Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
From MaRDI portal
Cited in
(17)- Sensitivity analysis for nonlinear programming using penalty methods
- Perturbed convex programming in reflexive Banach spaces
- Combinatorial behavior of extreme points of perturbed polyhedra
- Stability theorems for infinitely constrained mathematical programs
- Convergence properties of local solutions of sequences of mathematical programming problems in general spaces
- Stability in vector maximization - a survey
- Unification and extensions of some stability theorems in mathematical programming
- Characterizing an optimal input in perturbed convex programming
- Convergence and optimality of modified two-step algorithm for integrated system optimization and parameter estimation
- An optimization result for set-valued mappings and a stability property in vector problems with constraints
- Sensitivity and stability analysis for nonlinear programming
- Continuous perturbations of infinite optimization problems
- On constrained maxima of convex functions
- The lower semicontinuity of optimal solution sets
- scientific article; zbMATH DE number 3758093 (Why is no real title available?)
- Extensions of Radstrom's lemma with application to stability theory of mathematical programming
- Upper and lower semicontinuity for set-valued mappings involving constraints
This page was built for publication: Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656601)