Zobrazeno 1 - 10
of 42
pro vyhledávání: '"KOĊVARA, MICHAL"'
Minimizing the weight in topology optimization of frame structures under free-vibration eigenvalue constraints constitutes a challenging nonconvex polynomial optimization problem with strong singularities in the feasible set. Here, we adopt a nonline
Externí odkaz:
http://arxiv.org/abs/2405.08894
Weight optimization of frame structures with continuous cross-section parametrization is a challenging non-convex problem that has traditionally been solved by local optimization techniques. Here, we exploit its inherent semi-algebraic structure and
Externí odkaz:
http://arxiv.org/abs/2211.14066
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:
http://arxiv.org/abs/2107.04319
The aim of this paper is to solve large-and-sparse linear Semidefinite Programs (SDPs) with low-rank solutions. We propose to use a preconditioned conjugate gradient method within second-order SDP algorithms and introduce a new efficient precondition
Externí odkaz:
http://arxiv.org/abs/2105.08529
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:
http://arxiv.org/abs/1911.11366
Decomposition of arrow type positive semidefinite matrices with application to topology optimization
Autor:
Kocvara, Michal
Decomposition of large matrix inequalities for matrices with chordal sparsity graph has been recently used by Kojima et al.\ \cite{kim2011exploiting} to reduce problem size of large scale semidefinite optimization (SDO) problems and thus increase eff
Externí odkaz:
http://arxiv.org/abs/1911.09412
Autor:
Brune, Alexander, Kocvara, Michal
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 of variables. A basic example is the minimum complianc
Externí odkaz:
http://arxiv.org/abs/1904.06556
A small improvement in the structure of the material could save the manufactory a lot of money. The free material design can be formulated as an optimization problem. However, due to its large scale, second-order methods cannot solve the free materia
Externí odkaz:
http://arxiv.org/abs/1607.00549
Autor:
Kocvara, Michal, Mohammed, Sudaba
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:
http://arxiv.org/abs/1606.06201
Autor:
Kocvara, Michal, Mohammed, Sudaba
The aim of this paper is to design an efficient multigrid method for constrained convex optimization problems arising from discretization of some underlying infinite dimensional problems. Due to problem dependency of this approach, we only consider b
Externí odkaz:
http://arxiv.org/abs/1602.03771