Some relations between dualities, polarities, coupling functionals, and conjugations
From MaRDI portal
Publication:1081080
DOI10.1016/0022-247X(86)90021-1zbMath0601.46043MaRDI QIDQ1081080
Publication date: 1986
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Linear function spaces and their duals (46E99) Duality and reflexivity in normed linear and Banach spaces (46B10)
Related Items
A general theory of dual optimization problems, Jets, generalised convexity, proximal normality and differences of functions, Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **, Dual representations of hulls for functions satisfyingf(0) = inff(X\{0})*, Infimal generators and dualities between complete lattices, Duality between direct and indirect utility functions under minimal hypotheses, Multipliers and general Lagrangians, Separation, convexity and polarity in the space of normlinear functions, Approximation of Weak Convergence, Subdifferentials with respect to dualities, ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY, An extension of D.C. duality theory, with an appendix on ∗-subdifferentials, Quasiconvex duality theory by generalized conjugation methods, Critical duality, V -dualities and ⊥-dualities, Dualities between complete lattices, Are dualities appropriate for duality theories in optimization?, What is quasiconvex analysis?, Conjugacies adapted to lower semicontinuous functions, Unnamed Item, Projective dualities for quasiconvex problems, Axiomatic characterizations of the duality correspondence in consumer theory, Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
Cites Work
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Surrogate conjugate functionals and surrogate convexity
- Conjugacy in quasi-convex programming
- Polyhedral polarity defined by a general bilinear inequality
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
