Theoretical foundation of a Textured Decomposition algorithm Conference Paper

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.

authors

• Huang, Garng

published proceedings

• PROCEEDINGS OF THE 1995 AMERICAN CONTROL CONFERENCE, VOLS 1-6

author list (cited authors)

• HUANG, G. M., & HSIEH, S. C.

publication date

• January 1995

published in

• Proceedings of the ... American Control Conference. American Control Conference  Journal

International Standard Book Number (ISBN) 10

• 0-7803-2446-3

start page

• 1568

end page

• 1572

volume

• 3