Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Michal Kočvara"'
Publikováno v:
Journal of Global Optimization. 84:393-413
The optimization problems with a sparsity constraint is a class of important global optimization problems. A typical type of thresholding algorithms for solving such a problem adopts the traditional full steepest descent direction or Newton-like dire
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c36c6b467dcfa5a11af180348c766797
https://doi.org/10.1007/s10898-022-01143-1
https://doi.org/10.1007/s10898-022-01143-1
Autor:
Alexander Brune, Michal Kočvara
Publikováno v:
SIAM Journal on Scientific Computing. 42:A28-A53
One of the challenges encountered in optimization of mechanical structures, in particular in what is known as topology optimization, is the size of the problems, which can easily involve millions o...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12941bda2ad29e157f05d0421c7b86cc
https://doi.org/10.1137/19m1254490
https://doi.org/10.1137/19m1254490
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030755485
SSVM
SSVM
Discrete tomography (DT) naturally leads to a hierarchy of models of varying discretization levels. We employ multilevel optimization (MLO) to take advantage of this hierarchy: while working at the fine level we compute the search direction based on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::415ddaeea9350025784f1b41106dc2f2
https://doi.org/10.1007/978-3-030-75549-2_16
https://doi.org/10.1007/978-3-030-75549-2_16
Polynomial optimization is a fascinating field of study that has revolutionized the way we approach nonlinear problems described by polynomial constraints. The applications of this field range from production planning processes to transportation, ene
Autor:
Michal Kočvara, Jiří V. Outrata
Publikováno v:
Discrete & Continuous Dynamical Systems - S. 10:1329-1350
We formulate an inverse optimal design problem as a Mathematical Programming problem with Equilibrium Constraints (MPEC). The equilibrium constraints are in the form of a second-order conic optimization problem. Using the so-called Implicit Programmi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01e8ca2c0203e8389e61858c950ffeac
https://doi.org/10.3934/dcdss.2017071
https://doi.org/10.3934/dcdss.2017071
Inspired by multigrid methods for linear systems of equations, multilevel optimization methods have been proposed to solve structured optimization problems. Multilevel methods make more assumptions regarding the structure of the optimization model, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58aa6ed9fa69dda4d037e939bd63ca0d
Publikováno v:
SIAM Journal on Scientific Computing. 38:A128-A145
The discretization of constrained nonlinear optimization problems arising in the field of topology optimization yields algebraic systems which are challenging to solve in practice, due to pathological ill-conditioning, strong nonlinearity and size. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f59115bf8addc339b01353d974acdee6
https://doi.org/10.1137/140980387
https://doi.org/10.1137/140980387
Autor:
Michal Kočvara, Sudaba Mohammed
Publikováno v:
SIAM Journal on Scientific Computing. 38:B685-B709
An interior point method for the structural topology optimization is proposed. The linear systems arising in the method are solved by the conjugate gradient method preconditioned by geometric multigrid. The resulting method is then compared with the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e07dfb033e255cf67ca2a467490e25d4
https://doi.org/10.1137/15m1044126
https://doi.org/10.1137/15m1044126
Autor:
Michal Kočvara, Yun-Bin Zhao
Publikováno v:
SIAM Journal on Optimization. 25:1110-1134
The connection between the sparsest solution to an underdetermined system of linear equations and the weighted $\ell_1$-minimization problem is established in this paper. We show that seeking the sparsest solution to a linear system can be transforme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65fa64a92fa40a71aa4083cf36a357ba
https://doi.org/10.1137/140968240
https://doi.org/10.1137/140968240