Sensitivity analysis in convex programming
From MaRDI portal
Publication:979946
DOI10.1016/J.CAMWA.2009.06.041zbMATH Open1189.90166OpenAlexW1975412793MaRDI QIDQ979946FDOQ979946
P. Jiménez Guerra, M. J. Muñoz-Bouzo, Miguel Angel Melguizo
Publication date: 28 June 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.06.041
Recommendations
- Sensitivity analysis for convex multiobjective programming in abstract spaces
- Sensitivity analysis in parametrized convex vector optimization
- Sensitivity analysis for non-linear programs with linear constraints
- Sensitivity analysis in convex optimization through the circatangent derivative
- Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
Convex programming (90C25) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Sensitivity analysis in multiple objective linear programming: The tolerance approach
- Set-valued analysis
- Sensitivity analysis in multiobjective optimization
- Contingent derivative of the perturbation map in multiobjective optimization
- Sensitivity analysis for convex multiobjective programming in abstract spaces
- Stability and Sensitivity Analysis in Convex Vector Optimization
- On the envolvent theorem in multiobjective programming
- Nonscalarized multiobjective global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sensitivity and optimality conditions in the multiobjective differential programming
- Sensitivity analysis in multiobjective differential programming
- Stability in vector maximization - a survey
- Decomposition of the parametric space in multiobjective convex programs using the generalized Tchebycheff norm
- Title not available (Why is that?)
Cited In (22)
- Paratingent derivative applied to the measure of the sensitivity in multiobjective differential programming
- The envelope theorem for multiobjective convex programming via contingent derivatives
- Variational sets and asymptotic variational sets of proper perturbation map in parametric vector optimization
- On higher-order proto-differentiability and higher-order asymptotic proto-differentiability of weak perturbation maps in parametric vector optimization
- On higher-order adjacent derivative of perturbation map in parametric vector optimization
- Higher-order sensitivity analysis in nonconvex vector optimization
- Sensitivity analysis in convex vector optimization
- On higher-order proto-differentiability of perturbation maps
- Title not available (Why is that?)
- Sensitivity analysis of discrete preference functions using Koszul simplicial complexes
- Sensitivity analysis in differential programming through the Clarke derivative
- Sensitivity analysis for convex multiobjective programming in abstract spaces
- Sensitivity analysis in linear programming and semidefinite programming using interior-point methods
- Sensitivity analysis in convex optimization through the circatangent derivative
- Sensitivity analysis in economics
- Title not available (Why is that?)
- On Second-Order Composed Proto-Differentiability of Proper Perturbation Maps in Parametric Vector Optimization Problems
- Sensitivity Analysis of Parametrized Programs under Cone Constraints
- A natural extension of the classical envelope theorem in vector differential programming
- Sensitivity analysis in posynomial geometric programming
- Title not available (Why is that?)
- Sensitivity analysis in bilevel linear programming
This page was built for publication: Sensitivity analysis in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979946)
