Variational methods in convex analysis
From MaRDI portal
Publication:2501111
The authors use variational arguments, namely minimization arguments and decoupling mechanisms, to derive some fundamental theorems in convex analysis. Many important result in linear functional analysis can then be deduced as special cases.
Recommendations
Cites work
- A new proof for Rockafellar’s characterization of maximal monotone operators
- A new version of the Hahn-Banach theorem
- A survey of subdifferential calculus with applications
- Fenchel duality, Fitzpatrick functions and the Kirszbraun–Valentine extension theorem
- scientific article; zbMATH DE number 5125720 (Why is no real title available?)
- Implicit multifunction theorems
- On the variational principle
- The equivalence of several basic theorems for subdifferentials
Cited in
(15)- Variational methods in partially ordered spaces
- Convex analysis in the calculus of variations
- scientific article; zbMATH DE number 5954668 (Why is no real title available?)
- Variational Analysis in Sobolev andBVSpaces
- Coherent hedging in incomplete markets
- scientific article; zbMATH DE number 3940080 (Why is no real title available?)
- scientific article; zbMATH DE number 17648 (Why is no real title available?)
- scientific article; zbMATH DE number 51805 (Why is no real title available?)
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Sandwich theorem for quasiconvex functions and its applications
- Convex sub-differential sum rule via convex semi-closed functions with applications in convex programming
- Convexity and variational analysis
- Semi-definite programming and quantum information
- Variational geometric approach to generalized differential and conjugate calculi in convex analysis
- Revisiting some rules of convex analysis
This page was built for publication: Variational methods in convex analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501111)