On sequential optimality theorems for convex optimization problems

MaRDI QIDQ4617658zbMATH OpenFDO

Authors Jae Hyoung Lee, Gue Myung Lee

Publication date 6 February 2019

Full work available at URL http://www.yokohamapublishers.jp/online2/oplna/vol3/p155.html

zbMATH Keywords

\(\varepsilon\)-subgradientclosedness of characterization coneconvex optimization problemsequential optimality theoremssolution set

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 5824228
• Sequential optimality conditions for composed convex optimization problems
• scientific article; zbMATH DE number 5245384
• ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
• Improved sequential optimality conditions for vector optimization problems with cone-epi-closed functions

Cited in

(9)

• Sequential characterization of solutions in convex composite programming and applications to vector optimization
• Sequential optimality conditions for composed convex optimization problems
• Sequential subdifferential for multi-composed functions via perturbation approach
• scientific article; zbMATH DE number 5824228 (Why is no real title available?)
• Improved sequential optimality conditions for vector optimization problems with cone-epi-closed functions
• Sequential greedy approximation for certain convex optimization problems
• scientific article; zbMATH DE number 5245384 (Why is no real title available?)
• Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1]
• Liberating the subgradient optimality conditions from constraint qualifications

This page was built for publication: On sequential optimality theorems for convex optimization problems

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