Level sets regularization with application to optimization problems

DOI10.4067/S0719-06462020000100137zbMath1442.49043MaRDI QIDQ5113856

Moussa Barro, Sado Traoré

Publication date: 18 June 2020

Published in: Cubo (Temuco) (Search for Journal in Brave)

zbMATH Keywords

regularizationconjugacydualitypolaritylevel sets\(c\)-elementary functions

Mathematics Subject Classification ID

Duality theory (optimization) (49N15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Level sets relaxation, epigraphical relaxation and conditioning in optimization
• Conjugaison par tranches
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• A simplified conjugation scheme for lower semi-continuous functions
• Conjugaison par tranches et dualitë de toland
• On $\Phi $-Convexity in Extremal Problems
• Surrogate Programming and Multipliers in Quasi-convex Programming
• On a notion of subdifferentiability for non-convex functions^†
• What is quasiconvex analysis?
• Conjugacies adapted to lower semicontinuous functions
• On Quasi-Convex Duality
• Abstract convexity and global optimization

This page was built for publication: Level sets regularization with application to optimization problems