Level sets regularization with application to optimization problems

DOI10.4067/S0719-06462020000100137MaRDI QIDQ5113856zbMATH OpenFDO

Authors Moussa Barro, Sado Traoré

Publication date 18 June 2020

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

Full work available at URL https://doi.org/10.4067/S0719-06462020000100137

zbMATH Keywords

regularizationlevel setsdualityconjugacypolarity\(c\)-elementary functions

Mathematics Subject Classification ID

Duality theory (optimization) (49N15)

Recommendations

• Conjugaison par tranches
• Regularization by erasement
• Optimization by level set methods v:duality theorems for perturbed optimization problems²
• Duality and regularization for inf-sup problems
• Conjugate duality in convex optimization

Cites work

• scientific article; zbMATH DE number 3465097 (Why is no real title available?)
• scientific article; zbMATH DE number 1017537 (Why is no real title available?)
• scientific article; zbMATH DE number 3075425 (Why is no real title available?)
• A simplified conjugation scheme for lower semi-continuous functions
• Abstract convexity and global optimization
• Conjugacies adapted to lower semicontinuous functions
• Conjugaison par tranches
• Conjugaison par tranches et dualitë de toland
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• Level sets relaxation, epigraphical relaxation and conditioning in optimization
• On \Phi -Convexity in Extremal Problems
• On Quasi-Convex Duality
• On a notion of subdifferentiability for non-convex functions^†
• Surrogate Programming and Multipliers in Quasi-convex Programming
• What is quasiconvex analysis?

Cited in

(7)

• Slope and \(G\)-set characterization of set-valued functions and applications to non-differentiable optimization problems
• Conjugaison par tranches
• Level-set methods for convex optimization
• On the level set method in minimax theory
• Influence of dimension on the convergence of level-sets in total variation regularization
• A primal--dual operation on sets linked with closed convex relaxation processes
• Interval method for bounding level sets: Revisited and tested with global optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113856)