Directional differentiability of the optimal value function in convex semi-infinite programming

1995 ◽  
Vol 70 (1-3) ◽  
pp. 149-157 ◽  
Author(s):  
Alexander Shapiro
Keyword(s):  
Value Function ◽  
Optimal Value Function ◽  
Directional Differentiability ◽  
Optimal Value ◽  
Infinite Programming

Optimal value function in semi-infinite programming

1988 ◽  
Vol 59 (2) ◽  
pp. 261-279 ◽  
Author(s):  
M. A. Goberna ◽  
M. A. Lopez
Keyword(s):  
Value Function ◽  
Optimal Value Function ◽  
Optimal Value ◽  
Infinite Programming

Hadamard Directional Differentiability of the Optimal Value Function of a Quadratic Programming Problem

2018 ◽  
Vol 35 (03) ◽  
pp. 1850012 ◽  
Author(s):  
Sainan Zhang ◽  
Liwei Zhang ◽  
Hongwei Zhang ◽  
Qingsong Duan
Keyword(s):  
Quadratic Programming ◽  
Value Function ◽  
Convex Sets ◽  
Compact Convex ◽  
Optimal Solution ◽  
Optimal Value Function ◽  
Directional Differentiability ◽  
Optimal Value ◽  
Hadamard Directional Differentiability ◽  
Wolfe Dual

In this paper, we consider the stability analysis of a convex quadratic programming (QP) problem and its restricted Wolfe dual when all parameters in the problem are perturbed. Based on the continuity of the feasible set mapping, we establish the upper semi-continuity of the optimal solution mappings of the convex QP problem and the restricted Wolfe dual problem. Furthermore, by characterizing the optimal value function as a min–max optimization problem over two compact convex sets, we demonstrate the Lipschitz continuity and the Hadamard directional differentiability of the optimal value function.

Sign in / Sign up

Export Citation Format

Share Document