相关论文: The Tallest Column -- A Dynamical System Approach …
We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear…
In order to nd a non-negative solution to a system of inequalities, the corresponding dual problem is composed, which has a suitable unity basic matrix. In such a formulation, the objective function is replaced by set of constraints based…
A parallel computer system is a collection of processing elements that communicate and cooperate to solve large computational problems efficiently. To achieve this, at first the large computational problem is partitioned into several tasks…
This paper proposes a reformulation of the scenario-based two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case realization of…
In this article we develop a duality principle and concerning computational method for a structural optimization problem in elasticity. We consider the problem of finding the optimal topology for an elastic solid which minimizes its…
A new approach for generating stress-constrained topological designs in continua is presented. The main novelty is in the use of elasto-plastic modeling and in optimizing the design such that it will exhibit a linear-elastic response. This…
The increase in complexity of autonomous systems is accompanied by a need of data-driven development and validation strategies. Advances in computer graphics and cloud clusters have opened the way to massive parallel high fidelity…
In topology optimization, the design parameter with no contribution to the objective function vanishes. This causes the stiffness matrix to become singular. We show that a local optimal solution is obtained by Conjugate Residual Method and…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
A multiscale approach for fluid flow is developed that retains an atomistic description in key regions. The method is applied to a classic problem where all scales contribute: The force on a moving wall bounding a fluid-filled cavity.…
Superposition of sigmoid function over a finite time interval is shown to be equivalent to the linear combination of the solutions of a linearly parameterized system of logistic differential equations. Due to the linearity with respect to…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
The paper concerns the study of equilibrium points, namely the stationary solutions to the closed loop equation, of an infinite dimensional and infinite horizon boundary control problem for linear partial differential equations. Sufficient…
This work studies rearrangement problems involving the sorting of robots or objects in stack-like containers, which can be accessed only from one side. Two scenarios are considered: one where every robot or object needs to reach a…
Refinements of the worst case complexity over instances of fixed input size consider the input order or the input structure, but rarely both at the same time. Barbay et al. [2016] described ``synergistic'' solutions on multisets, which take…
In this letter a new solvable model of synchronization dynamics is introduced. It consists of a system of long range interacting tops with random precession frequencies. The model allows for an explicit study of orientational effects in…
A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…
Homotopy methods are attractive due to their capability of solving difficult optimisation and optimal control problems. The underlying idea is to construct a homotopy, which may be considered as a continuous (zero) curve between the…
Identifying optimal basic feasible solutions to linear programming problems is a critical task for mixed integer programming and other applications. The crossover method, which aims at deriving an optimal extreme point from a suboptimal…
In this document, we deal with the stabilization problem of slow-fast systems (or singularly perturbed Ordinary Differential Equations) at a non-hyperbolic point. The class of systems studied here have the following properties: 1) they have…