Norm duality for convex processes and applications
type: Item
instance of: scholarly article
title: Norm duality for convex processes and applications
zbMATH Open document ID: 0557.49009
DOI: 10.1007/BF00938589
published in: Journal of Optimization Theory and Applications
publication date: 1986-01-01T00:00:00Z
review text: One can associate two norms with a Banach space convex process. These norms are dual to each other and the norm of a process agrees with the dual norm of its adjoint. This norm duality provides an extremely general and simple way of establishing surjectivity or boundedness properties of homogeneous (linear or convex) inequality systems.
Mathematics Subject Classification ID: 49N15
Mathematics Subject Classification ID: 52A40
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 46B10
Mathematics Subject Classification ID: 49K27
Mathematics Subject Classification ID: 47A30
zbMATH DE Number: 3888402
zbMATH Keywords: Banach space
zbMATH Keywords: convex process
zbMATH Keywords: norm duality
zbMATH Keywords: surjectivity
zbMATH Keywords: boundedness
zbMATH Keywords: inequality systems
Wikidata QID: Q56935997
author: Jonathan M. Borwein
MaRDI profile type: Publication
cites work: Adjoint Process Duality
cites work: Q3945136
cites work: Normed Convex Processes
cites work: Monotone processes of convex and concave type
cites work: Q3320147
cites work: Ordered linear spaces
cites work: Regularity and Stability for Convex Multivalued Functions
cites work: Q4080172
cites work: Q4104377
cites work: Weak Tangent Cones and Optimization in a Banach Space
cites work: On the existence and nonexistence of Lagrange multipliers in Banach spaces
cites work: Another application of Guignard's generalized Kuhn-Tucker conditions
cites work: Q3909536
cites work: Generalized linear complementarity problems treated without fixed-point theory
cites work: A Lagrange multiplier theorem and a sandwich theorem for convex relations.
cites work: The Open Mapping Theorem
cites work: Q4050397
cites work: Remark on the Constraint Sets in Linear Programming
cites work: A generalized Farkas lemma with applications to quasidifferentiable programming
cites work: A generalization of the Farkas lemma and applications to convex programming
full work available at URL: https://doi.org/10.1007/bf00938589
OpenAlex ID: W99853481
Recommended article: Convex duality, convex calculus, and their applications
Recommended article: Lyapunov functions and duality for convex processes
Recommended article: Duality for the sum of convex functions in general normed spaces
Recommended article: Uniform Boundedness of Norms of Convex and Nonconvex Processes
Recommended article: Duality for nonconvex optimization and its applications
Recommended article: Q3321847
Recommended article: Q4007877
Recommended article: On duality with generalized convexity
Recommended article: Abstract convexity for nonconvex optimization duality
Recommended article: Q3150873
description: scientific article; zbMATH DE number 3888402