A selection principle with applications in convex analysis and optimization

DOI10.1016/0022-247X(88)90262-4zbMath0668.49009MaRDI QIDQ1118149

Dominikus Noll

Publication date: 1988

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

positive coneselection principleKuhn-Tucker theoremlocally convex vector spacelinear set-valued mappingssubdifferentiable

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• Unnamed Item
• A duality theorem for a convex programming problem in order complete vector lattices
• Linear maps majorized by a sublinear map
• Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
• Unconditional convergence in partially ordered linear spaces
• Subdifferentials of convex mappings and of compositions of functions
• Continuity and Differentiability Properties of Convex Operators
• Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
• Dual nonlinear programming problems in partially ordered Banach spaces
• Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.

This page was built for publication: A selection principle with applications in convex analysis and optimization