Necessary and sufficient condition on decomposable convex programming

    Research output: Contribution to journalArticlepeer-review


    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).

    Original languageEnglish
    Pages (from-to)351-359
    Number of pages9
    JournalProceedings of the National Science Council, Republic of China, Part A: Physical Science and Engineering
    Issue number4
    Publication statusPublished - 1996 Jul

    ASJC Scopus subject areas

    • Engineering(all)

    Fingerprint Dive into the research topics of 'Necessary and sufficient condition on decomposable convex programming'. Together they form a unique fingerprint.

    Cite this