Theoretical foundation of a textured decomposition algorithm

Garng M. Huang, Shih Chieh Hsieh

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

A Textured Decomposition Method (TDM) is proposed for large-scale convex optimization problems, in which a problem is reduced to a set of more tractable subproblems by rotatingly fixing some complicating (interaction or coupling) variables. The approach is appealing since mutually independent subproblems can be solved in parallel. Accordingly, the TDM solves a large-scale convex optimization problem by iteratively solving a sequence of concurrent subproblems. Necessary and sufficient conditions to guarantee that the converged solution of the TDM be the optimal solution of the original problem are addressed.

Original languageEnglish
Pages (from-to)1568-1572
Number of pages5
JournalProceedings of the American Control Conference
Volume3
Publication statusPublished - 1 Jan 1995
EventProceedings of the 1995 American Control Conference. Part 1 (of 6) - Seattle, WA, USA
Duration: 21 Jun 199523 Jun 1995

    Fingerprint

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this