Multi-composition rule of convex subdifferential calculus
From MaRDI portal
Publication:6492467
DOI10.1080/02331934.2023.2168480MaRDI QIDQ6492467FDOQ6492467
Publication date: 25 April 2024
Published in: Optimization (Search for Journal in Brave)
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Duality in Vector Optimization
- 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
- Multi-Composed Programming with Applications to Facility Location
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)
