Level sets regularization with application to optimization problems
From MaRDI portal
Publication:5113856
Recommendations
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)- On the level set method in minimax theory
- Slope and \(G\)-set characterization of set-valued functions and applications to non-differentiable optimization problems
- Conjugaison par tranches
- Interval method for bounding level sets: Revisited and tested with global optimization problems
- 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
- Level-set methods for convex optimization
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)
