### Abstract

In this paper, we extend our Textured Algorithm [1]-[4] to multi-intersected textured models. We also describe the recursive textured decomposition process as a tree, in which we can obtain the overall solution by consolidating the end subsystem solutions. The proposed algorithms, their properties, and the theorems for exact convergence are then addressed. The worst-case time complexity of the algorithm with complete tree structure, in which parents in the same recursion level have the same number of children, is analyzed. Examples are given to demonstrate the use of the algorithms and the trade-off among the number of recursion levels, the number of sequential computing steps, and problem size reduction.

Original language | English |
---|---|

Pages (from-to) | 1121-1126 |

Number of pages | 6 |

Journal | Proceedings of the IEEE Conference on Decision and Control |

Volume | 2 |

Publication status | Published - 1 Dec 1995 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Control and Systems Engineering
- Modelling and Simulation
- Control and Optimization

### Cite this

*Proceedings of the IEEE Conference on Decision and Control*,

*2*, 1121-1126.

**Multi-intersected/recursive textured algorithms for large-scale convex optimization problems.** / Huang, Garng Morton; Hsieh, Shih Chieh.

Research output: Contribution to journal › Conference article

*Proceedings of the IEEE Conference on Decision and Control*, vol. 2, pp. 1121-1126.

}

TY - JOUR

T1 - Multi-intersected/recursive textured algorithms for large-scale convex optimization problems

AU - Huang, Garng Morton

AU - Hsieh, Shih Chieh

PY - 1995/12/1

Y1 - 1995/12/1

N2 - In this paper, we extend our Textured Algorithm [1]-[4] to multi-intersected textured models. We also describe the recursive textured decomposition process as a tree, in which we can obtain the overall solution by consolidating the end subsystem solutions. The proposed algorithms, their properties, and the theorems for exact convergence are then addressed. The worst-case time complexity of the algorithm with complete tree structure, in which parents in the same recursion level have the same number of children, is analyzed. Examples are given to demonstrate the use of the algorithms and the trade-off among the number of recursion levels, the number of sequential computing steps, and problem size reduction.

AB - In this paper, we extend our Textured Algorithm [1]-[4] to multi-intersected textured models. We also describe the recursive textured decomposition process as a tree, in which we can obtain the overall solution by consolidating the end subsystem solutions. The proposed algorithms, their properties, and the theorems for exact convergence are then addressed. The worst-case time complexity of the algorithm with complete tree structure, in which parents in the same recursion level have the same number of children, is analyzed. Examples are given to demonstrate the use of the algorithms and the trade-off among the number of recursion levels, the number of sequential computing steps, and problem size reduction.

UR - http://www.scopus.com/inward/record.url?scp=0029517393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029517393&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0029517393

VL - 2

SP - 1121

EP - 1126

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -