Generalized differentiation and duality in infinite dimensions under polyhedral convexity

DOI10.1007/s11228-022-00647-yOpenAlexW4295540415WikidataQ114223367 ScholiaQ114223367MaRDI QIDQ2677672

Yanyan Li

Publication date: 5 January 2023

Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)

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

zbMATH Keywords

geometric approachnormal conecoderivativeconvex analysisgeneralized differentiationrelative interiorcalculus rulessolution maps

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)

Related Items (1)

Relationships between polyhedral convex sets and generalized polyhedral convex sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasi-relative interiors for graphs of convex set-valued mappings
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Notions of relative interior in Banach spaces
• Fenchel duality in infinite-dimensional setting and its applications.
• Quasimonotone variational inequalities in Banach spaces
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• Geometric approach to convex subdifferential calculus
• Strong Duality in Cone Constrained Nonconvex Optimization
• Convex Analysis

This page was built for publication: Generalized differentiation and duality in infinite dimensions under polyhedral convexity