Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes

Ähnliche Einträge

• A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
  von: García-Castaño, Fernando, et al.
  Veröffentlicht: (2024)
• Process-Based Lagrange Multipliers for Nonconvex Set-Valued Optimization
  von: García-Castaño, Fernando, et al.
  Veröffentlicht: (2026)
• Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
  von: García-Castaño, Fernando, et al.
  Veröffentlicht: (2025)
• A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
  von: Dörfler, Daniel, et al.
  Veröffentlicht: (2020)
• Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
  von: García-Castaño, Fernando, et al.
  Veröffentlicht: (2024)