On optimality in abstract convex programming

DOI10.1007/BF01916896zbMath0502.90067OpenAlexW1968919187MaRDI QIDQ3968766

Leslie Ian Trudzik

Publication date: 1983

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01916896

zbMATH Keywords

uniform convergenceoptimality conditionscone-convex functionscharacterizations of optimalityinconsistency of cone inclusions

Mathematics Subject Classification ID

Convex programming (90C25) Semi-infinite programming (90C34)

Related Items

Input optimization: I. Optimal realizations of mathematical models, Perturbed convex programming in reflexive Banach spaces, Unnamed Item, Some properties of efficient solutions for vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization of optimality in convex programming without a constraint qualification
• Foundations of optimization
• Differential calculus in topological linear spaces
• A course on optimization and best approximation
• Complete characterization of optimality for convex programming in banach spaces^†
• Optimality conditions for convex semi-infinite programming problems
• On A characterization of optimality in convex programming
• Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
• Convex Analysis