Abstract
Viscosity methods for minimization problems are revisited from some modern perspectives in variational analysis. Variational convergences for sequences of functions (epi-convergence, $\Gamma $-convergence, Mosco-convergence) and for sequences of operators (graph-convergence) provide a flexible tool for such questions. It is proved, in a rather large setting, that the solutions of the approximate problems converge to a ``viscosity solution'' of the original problem, that is, a solution that is minimal among all the solutions with respect to some viscosity criteria. Various examples coming from mathematical programming, calculus of variations, semicoercive elliptic equations, phase transition theory, Hamilton--Jacobi equations, singular perturbations, and optimal control theory are considered.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
