Characterizing an optimal input in perturbed convex programming
From MaRDI portal
Cites work
- A simplified test for optimality
- An Application of Error Bounds for Convex Programming in a Linear Space
- An iterative method for ill-posed problems with inequalities
- Calculating the cone of directions of constancy
- Convergence properties of local solutions of sequences of mathematical programming problems in general spaces
- Convex Analysis
- Duality in convex programming: a linearization approach1
- Extensions of the Evans-Gould Stability Theorems for Mathematical Programs
- Foundations of optimization
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- scientific article; zbMATH DE number 3687129 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 3728042 (Why is no real title available?)
- scientific article; zbMATH DE number 3778225 (Why is no real title available?)
- scientific article; zbMATH DE number 3623323 (Why is no real title available?)
- scientific article; zbMATH DE number 3630503 (Why is no real title available?)
- scientific article; zbMATH DE number 3630504 (Why is no real title available?)
- scientific article; zbMATH DE number 3797510 (Why is no real title available?)
- scientific article; zbMATH DE number 3446685 (Why is no real title available?)
- scientific article; zbMATH DE number 3431352 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Marginal Values in Linear Programming
- On the continuity of the maximum in parametric linear programming
- On the continuity of the minimum set of a continuous function
- Stability in convex quadratic parametric programming
- Stability in Nonlinear Programming
- Stabilization and determination of the set of minimal binding constraints in convex programming1
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- The Generalized Gradient of a Marginal Function in Mathematical Programming
Cited in
(14)- Characterizing optimality in mathematical programming models
- Characterization of perturbed mathematical programs and interval analysis
- Some properties of boundedly perturbed strictly convex quadratic functions
- Input optimization: I. Optimal realizations of mathematical models
- On the continuity of a Lagrangian multiplier function in input optimization
- Characterizing an optimal input in perturbed convex programming: Corrigendum
- Input optimization: III. optimal realizations of multiobjective models
- scientific article; zbMATH DE number 4030851 (Why is no real title available?)
- Survey of input optimization1
- New regions of stability in input optimization
- Sensitivity of efficiency classifications in the additive model of data envelopment analysis
- Convex Parametric Programming in Abstract Spaces
- Global infimum of strictly convex quadratic functions with bounded perturbations
- Maximizing strictly convex quadratic functions with bounded perturbations
This page was built for publication: Characterizing an optimal input in perturbed convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4742581)