Sensitivity analysis of the value function for nonsmooth optimization problems

DOI10.1016/j.orl.2017.04.012zbMath1409.90194OpenAlexW2616369993MaRDI QIDQ1728258

M. Alavi Hejazi, Soghra Nobakhtian

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2017.04.012

zbMATH Keywords

nonsmooth analysissensitivity analysisnecessary optimality conditionconvexificator

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Related Items (1)

Interval-valued value function and its application in interval optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions
• Introduction to sensitivity and stability analysis in nonlinear programming
• Subgradients of marginal functions in parametric mathematical programming
• Error bounds: necessary and sufficient conditions
• Sensitivity analysis for non-linear programs with linear constraints
• A generalized derivative for calm and stable functions
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Marginal values and second-order necessary conditions for optimality
• Optimization and nonsmooth analysis
• Differential properties of the marginal function in mathematical programming
• Convexifactors, generalized convexity and vector optimization
• Lagrange Multipliers for Nonconvex Generalized Gradients with Equality, Inequality, and Set Constraints
• The Linear Nonconvex Generalized Gradient and Lagrange Multipliers
• Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming

This page was built for publication: Sensitivity analysis of the value function for nonsmooth optimization problems