Necessary and sufficient condition on decomposable convex programming

研究成果: 雜誌貢獻期刊論文同行評審

摘要

This paper considers a kind of decomposible convex programming: (P) min{f(x); xε C}, and its corresponding decomposible variational inequality DVI(f, C), where f(x):=f1(x1)+f2 (x2)+···+fn(xn), for every x:=(x1, x2, ···, xn) and C:=C1xC2x···xCn···xCn . Under the constraint qualification 0 ε ri(piin = 1 (coD (∂fi) - Ci),we show that x is a solution to DVI(f, C) if, and only if, x is an optimal solution of (P).

原文英語
頁(從 - 到)351-359
頁數9
期刊Proceedings of the National Science Council, Republic of China, Part A: Physical Science and Engineering
20
發行號4
出版狀態已發佈 - 1996 七月

ASJC Scopus subject areas

  • Engineering(all)

指紋 深入研究「Necessary and sufficient condition on decomposable convex programming」主題。共同形成了獨特的指紋。

引用此