Multi-composition rule of convex subdifferential calculus

DOI10.1080/02331934.2023.2168480MaRDI QIDQ6492467FDOQ6492467

Authors I. Dali

Publication date 25 April 2024

Published in Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Continuous location (90B85)

Recommendations

• New results in subdifferential calculus with applications to convex optimization
• scientific article; zbMATH DE number 734672
• Weaker conditions for subdifferential calculus of convex functions
• Characterizations of convex approximate subdifferential calculus in Banach spaces
• Sequential Pareto subdifferential multi-composition rule and application to multiobjective minimax location problems

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 734672 (Why is no real title available?)
• scientific article; zbMATH DE number 1148264 (Why is no real title available?)
• scientific article; zbMATH DE number 7326973 (Why is no real title available?)
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• A Lagrange duality approach for multi-composed optimization problems
• A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality
• Duality in Vector Optimization
• Multi-composed programming with applications to facility location
• Sequential approximate optimality conditions for multi objective fractional programming problems via sequential approximate subdifferential calculus

This page was built for publication: Multi-composition rule of convex subdifferential calculus

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