Clark's Theorem on linear programs holds for convex programs

DOI10.1073/PNAS.75.4.1624MaRDI QIDQ4154374zbMATH OpenOpenAlexWikidataFDO

Authors Richard J. Duffin

Publication date 1978

Published in Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/pnas.75.4.1624

Mathematics Subject Classification ID

Convex programming (90C25)

Cited in

(8)

• Clark's theorem for semi-infinite convex programs
• Universal duality in conic convex optimization
• On the existence of a saddle value
• Boundedness relations in linear semi-infinite programming
• On the existence of a saddle value for nonconvex and noncoercive bifunctions
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
• Duality gaps in semi-infinite linear programming—an approximation problem
• Inequality systems and minimax theorems

This page was built for publication: Clark's Theorem on linear programs holds for convex programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154374)