| bibtype |
J -
Journal Article
|
| ARLID |
0532970 |
| utime |
20240103224520.6 |
| mtime |
20201012235959.9 |
| SCOPUS |
85086374125 |
| WOS |
000539869200001 |
| DOI |
10.1007/s10107-020-01526-w |
| title
(primary) (eng) |
Decomposition of arrow type positive semidefinite matrices with application to topology optimization |
| specification |
| page_count |
30 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0257227 |
| ISSN |
0025-5610 |
| title
|
Mathematical Programming |
| volume_id |
190 |
| page_num |
105-134 |
| publisher |
|
|
| keyword |
semidefinite optimization |
| keyword |
positive semidefinite matrices |
| keyword |
chordal graphs |
| keyword |
domain decomposition |
| keyword |
topology optimization |
| author
(primary) |
| ARLID |
cav_un_auth*0101131 |
| name1 |
Kočvara |
| name2 |
Michal |
| institution |
UTIA-B |
| full_dept (cz) |
Matematická teorie rozhodování |
| full_dept (eng) |
Department of Decision Making Theory |
| department (cz) |
MTR |
| department (eng) |
MTR |
| full_dept |
Department of Decision Making Theory |
| share |
100 |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| source |
|
| cas_special |
| abstract
(eng) |
Decomposition of large matrix inequalities for matrices with chordal sparsity graph has been recently used by Kojima et al. (Math Program 129(1):33–68, 2011) to reduce problem size of large scale semidefinite optimization (SDO) problems and thus increase efficiency of standard SDO software. A by-product of such a decomposition is the introduction of new dense small-size matrix variables. We will show that for arrow type matrices satisfying suitable assumptions, the additional matrix variables have rank one and can thus be replaced by vector variables of the same dimensions. This leads to significant improvement in efficiency of standard SDO software. We will apply this idea to the problem of topology optimization formulated as a large scale linear semidefinite optimization problem. Numerical examples will demonstrate tremendous speed-up in the solution of the decomposed problems, as compared to the original large scale problem. In our numerical example the decomposed problems exhibit linear growth in complexity, compared to the more than cubic growth in the original problem formulation. We will also give a connection of our approach to the standard theory of domain decomposition and show that the additional vector variables are outcomes of the corresponding discrete Steklov–Poincaré operators. |
| result_subspec |
WOS |
| RIV |
BA |
| FORD0 |
10000 |
| FORD1 |
10100 |
| FORD2 |
10101 |
| reportyear |
2022 |
| num_of_auth |
1 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0311548 |
| confidential |
S |
| mrcbC86 |
n.a. Article Computer Science Software Engineering|Operations Research Management Science|Mathematics Applied |
| mrcbC91 |
A |
| mrcbT16-e |
COMPUTERSCIENCESOFTWAREENGINEERING|MATHEMATICSAPPLIED|OPERATIONSRESEARCHMANAGEMENTSCIENCE |
| mrcbT16-j |
2.577 |
| mrcbT16-s |
2.794 |
| mrcbT16-D |
Q1* |
| mrcbT16-E |
Q1* |
| arlyear |
2021 |
| mrcbU14 |
85086374125 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000539869200001 WOS |
| mrcbU63 |
cav_un_epca*0257227 Mathematical Programming 0025-5610 1436-4646 Roč. 190 1-2 2021 105 134 Springer |
|