Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality

DOI10.1080/02331934.2022.2031192OpenAlexW3166660250MaRDI QIDQ5879572

No author found.

Publication date: 2 March 2023

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.01662

zbMATH Keywords

reducibilityLagrangian dualityconvex infinite programmingHaar duality

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
• New glimpses on convex infinite optimization duality
• Conjugate duality in convex optimization
• Duality in D. C. programming: The case of several D. C. constraints
• Duality for the robust sum of functions
• A duality theorem for semi-infinite convex programs and their finite subprograms
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Zero duality gap conditions via abstract convexity
• New Farkas-type constraint qualifications in convex infinite programming

This page was built for publication: Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality