版权所有：内蒙古大学图书馆 技术提供：维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
A COMPARISON OF CONSTRAINT QUALIFICATIONS IN INFINITE-DIMENSIONAL CONVEX-PROGRAMMING
在无限维的凸的编程的限制资格的比较出 版 物：《SIAM JOURNAL ON CONTROL AND OPTIMIZATION》 (工业与应用数学会控制与最佳化杂志)
年 卷 期：1990年第28卷第4期
页 面：925-935页
核心收录：
学科分类：07[理学] 070104[理学-应用数学] 0811[工学-控制科学与工程] 0701[理学-数学]
主 题：49A27 49A55 90C25 90C48 constraint qualifications convex programming duality theory
摘 要：In this paper the relationships between various constraint qualifications for infinite-dimensional convex programs are investigated. Using Robinson’s refinement of the duality result of Rockafellar, it is demonstrated that the constraint qualification proposed by Rockafellar provides a systematic mechanism for comparing many constraint qualifications as well as establishing new results in different topological environments.
