Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS - MaRDI portal

ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS

From MaRDI portal
Publication:5398435

DOI10.4134/BKMS.2014.51.1.287zbMath1291.90253OpenAlexW1988066161MaRDI QIDQ5398435

Tiên Sȯn Phạm, Gue Myung Lee

Publication date: 28 February 2014

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://mathnet.or.kr/mathnet/kms_content.php?no=412019




Related Items

Robustness in nonsmooth nonconvex optimization problemsOptimality conditions for robust nonsmooth multiobjective optimization problems in asplund spacesUnnamed ItemSome characterizations of robust optimal solutions for uncertain convex optimization problemsOptimality conditions for robust weak sharp efficient solutions of nonsmooth uncertain multiobjective optimization problemsCharacterizations for optimality conditions of general robust optimization problemsSome characterizations of approximate solutions for robust semi-infinite optimization problemsNecessary optimality conditions for nonsmooth robust optimization problemsOn nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimizationSufficient Optimality Conditions for a Robust Multiobjective ProblemCharacterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentialsApproximate solution in robust multi-objective optimization and its application in portfolio optimizationOptimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraintsOptimality conditions in optimization under uncertaintyApplying convexificators in robust multiobjective optimizationOn mathematical programs with equilibrium constraints under data uncertaintyRobustness characterizations for uncertain optimization problems via image space analysisRobust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain dataOptimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programmingOn robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertaintyConstraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problemsRobust optimality conditions for multiobjective programming problems under data uncertainty and its applicationsRobust Optimality and Duality in Multiobjective Optimization Problems under Data UncertaintyRobust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applicationsApproximate solutions for robust multiobjective optimization programming in Asplund spacesOn constraint qualifications and optimality conditions for robust optimization problems through pseudo-differentialOptimality conditions for a nonsmooth uncertain multiobjective programming problemRobust approximate optimal solutions for nonlinear semi-infinite programming with uncertaintyUnnamed ItemUnnamed ItemOptimality and duality for robust multiobjective optimization problemsKarush-Kuhn-Tucker optimality conditions for a class of robust optimization problems with an interval-valued objective functionUnnamed ItemCharacterizations of robustε-quasi optimal solutions for nonsmooth optimization problems with uncertain dataOn \(\epsilon\)-solutions for robust semi-infinite optimization problemsOn approximate solutions for nonsmooth robust multiobjective optimization problemsUnified robust necessary optimality conditions for nonconvex nonsmooth uncertain multiobjective optimizationSome characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints