Approximate optimization of convex set functions

zbMATH Open1194.90077MaRDI QIDQ3633769FDOQ3633769

Authors: Davinder Bhatia, Narender Kumar 

Publication date: 23 June 2009

Recommendations

• ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
• Convex programming with set functions
• On the optimality of differentiable nonconvex \(n\)-set functions
• The Multiobjective Optimization Problem of Set Function
• scientific article; zbMATH DE number 1757114

zbMATH Keywords

approximate solutions\(\varepsilon\)-subdifferential

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions for problems in abstract spaces (49K27)

Cited In (8)

• ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
• Title not available (Why is that?)
• Techniques for exploring the suboptimal set
• About asymptotic analysis and set optimization
• Subdifferential and optimality conditions for convex set functions
• The Multiobjective Optimization Problem of Set Function
• Title not available (Why is that?)
• Approximate optimality conditions and sensitivity analysis in nearly convex optimization

This page was built for publication: Approximate optimization of convex set functions

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