scientific article; zbMATH DE number 7368328

zbMath1466.90103MaRDI QIDQ4999194

Jen-Chih Yao, Gue Myung Lee

Publication date: 6 July 2021

Full work available at URL: http://www.yokohamapublishers.jp/online-p/JNCA/vol17/jncav17n5p957.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex functionLagrangian multiplierssolution setslocally Lipschitz functionsgeneralized gradientsgeneralized directional derivativepseudo convex functionrobust optimization problem

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Robustness in mathematical programming (90C17)

Related Items (4)

Optimality conditions and duality for robust nonsmooth multiobjective optimization problems with constraints ⋮ Characterizing the solution set of convex optimization problems without convexity of constraints ⋮ Radius of robust feasibility of system of convex inequalities with uncertain data ⋮ Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems

This page was built for publication: