Sufficient Optimality and Sensitivity Analysis of a Parameterized Min-Max Programming
Sufficient optimality and sensitivity of a parameterized min-max programming with fixed feasible set are analyzed. Based on Clarke's subdifferential and Chaney's second-order directional derivative, sufficient optimality of the parameterized min-max programming is discussed first. Moreover...
Saved in:
Main Authors: | Huijuan Xiong, Yu Xiao, Chaohong Song |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/692325 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The backtrack Hölder gradient method with application to min-max and min-min problems
by: Bolte, Jérôme, et al.
Published: (2023-12-01) -
A min-max theorem and its applications to nonconservative systems
by: Li Weiguo, et al.
Published: (2003-01-01) -
Max-Min Fair Link Quality in WSN Based on SINR
by: Ada Gogu, et al.
Published: (2014-01-01) -
On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems
by: Vladimir Bondarenko, et al.
Published: (2016-01-01) -
He's Max-Min Approach to a Nonlinear Oscillator with Discontinuous Terms
by: Hui-Li Zhang, et al.
Published: (2013-01-01)