Level sets regularization with application to optimization problems
From MaRDI portal
Publication:5113856
DOI10.4067/S0719-06462020000100137zbMATH Open1442.49043MaRDI QIDQ5113856FDOQ5113856
Publication date: 18 June 2020
Published in: Cubo (Temuco) (Search for Journal in Brave)
Recommendations
Cites Work
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conjugaison par tranches
- Title not available (Why is that?)
- What is quasiconvex analysis?
- On Quasi-Convex Duality
- Abstract convexity and global optimization
- Surrogate Programming and Multipliers in Quasi-convex Programming
- Conjugaison par tranches et dualitë de toland
- On $\Phi $-Convexity in Extremal Problems
- On a notion of subdifferentiability for non-convex functions†
- Conjugacies adapted to lower semicontinuous functions
- Level sets relaxation, epigraphical relaxation and conditioning in optimization
- A simplified conjugation scheme for lower semi-continuous functions
Cited In (5)
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)