Multi-composition rule of convex subdifferential calculus
From MaRDI portal
(Redirected from Publication:6492467)
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
- 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
- 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?)
- 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)
