Abstract. A problem of the model-based optimization of fed-batch cultivation process is solved for two control actions: feed-rate and dilution rate. A goal of optimization is to maximize the yield of cells’ biomass at the end of cultivation cycle. Two alternative optimization methods, based on the maximum principle of Pontryagin and the finite dimensional optimization approach, are developed fo...

Despite all the progress in filtering algorithms for state estimation in very high dimensional systems, the technology is delicate and sometimes difficult to apply. Good initialization of filter gain, appropriate choice of tuning parameters and their optimization are the key factors to achieve robust high-performance filtering algorithms. In this paper the authors propose a method for properly ...

We consider primal-dual algorithms for certain types of infinite-dimensional optimization problems. Our approach is based on the generalization of the technique of finite-dimensional Euclidean Jordan algebras to the case of infinite-dimensional JB-algebras of finite rank. This generalization enables us to develop polynomial-time primal-dual algorithms for “infinite-dimensional second-order cone...

This paper presents an extended version of the separation plane algorithms for subgradientbased finite-dimensional nondifferentiable convex blackbox optimization. The extension introduces additional cuts for epigraph of the conjugate of objective function which improve the convergence of the algorithm. The case of affine cuts is considered in more details and it is shown that it requires soluti...

In the optimization process of a complex three-dimensional continuum structure by using the conventional evolutionary structural optimization method, some isolated groups of elements or a few elements being of rigid movements, often appear in the optimized structure, which becomes singular so that the optimization process can’t continue. In order to overcome this problem, this paper proposes an...

Equipment C. Trinitis Lehrstuhl f ur Rechnertechnik und Rechnerorganisation Institut f ur Informatik Technische Universit at M unchen GERMANY Abstract The goal of nding an optimal electric eld strength distribution for arbitrary three dimensional problems can be achieved by utilizing a parametric CAD modelling system that needs to be coupled with a three dimensional electric eld calculation...

Abstract. We consider techniques that enable large-scale gradient-based shape optimization of wave-guiding devices in the context of 3D time-domain simulations. The approach relies on a memory efficient boundary representation of the shape gradient together with primal and adjoint solvers semi-automatically generated by the FEniCS framework. The hyperbolic character of the governing linear wave...

Across domains, the scale of data and complexity of machine learning models have both been increasing greatly in recent years. For many such large scale models of interest, tractable estimation without access to extensive computational infrastructure is still an open problem. In this thesis, we approach the tractability of large-scale estimation problems through the lens of leveraging sparse st...

This paper discusses the potential of graphics processing units (GPUs) in high-dimensional optimization problems. A single GPU card with hundreds of arithmetic cores can be inserted in a personal computer and dramatically accelerates many statistical algorithms. To exploit these devices fully, optimization algorithms should reduce to multiple parallel tasks, each accessing a limited amount of d...

Active set methods based on the augmented Lagrangian smoothing of nondiier-entiable optimization problems that arise in image restoration are discussed. One-dimensional image restoration problem and two diierent formulations for two-dimensional image restoration problem are given. Both nonmonotone and monotone active set algorithms are described and nite step convergence of the algorithms is co...