Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints

MaRDI QIDQ5160457zbMATH OpenFDO

Authors Tatiana Shitkovskaya, Zhe Hong, Liguo Jiao, Do Sang Kim

Publication date 28 October 2021

Full work available at URL http://yokohamapublishers.jp/online2/opjnca/vol20/p1825.html

zbMATH Keywords

approximate dualityapproximate optimality conditionsMordukhovich/limiting subdifferentialquasi \(\epsilon\)-solutionsrobust optimization

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• scientific article; zbMATH DE number 7238249
• Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
• scientific article; zbMATH DE number 7620762
• Approximate optimality conditions for robust convex optimization without convexity of constraints

Cited in

(2)

• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
• An effective optimization algorithm for locally nonconvex Lipschitz functions based on mollifier subgradients

This page was built for publication: Approximate solutions in nonsmooth robust optimization with locally Lipschitz constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5160457)