Abstract. In this paper we present the results of Fluid-Structure Interaction (FSI) computations of an incompressible solid object and laminar incompressible viscous flows using a combined penalty-projection algorithm. The system consists of a fluid region governed by Navier-Stokes equations and a solid domain described by elastic and hyperelastic structure mechanical equations. In particular w...

This paper proposes a reduced-rank scheme for adaptive beamforming based on the constrained joint iterative optimization of filters. We employ this scheme to devise two novel reduced-rank adaptive algorithms according to the constant modulus (CM) criterion with different constraints. The first devised algorithm is formulated as a constrained joint iterative optimization of a projection matrix a...

We describe and analyze an algorithmic framework for online classification where each online trial consists of multiple prediction tasks that are tied together. We tackle the problem of updating the online predictor by defining a projection problem in which each prediction task corresponds to a single linear constraint. These constraints are tied together through a single slack parameter. We th...

We introduce a method for multichannel restoration of images in which there is severely limited knowledge about the undegraded signal, and possibly the noise. We assume that we know the channel degradations and that there will be a significant noise reduction in a postprocessing stage in which multiple realizations are combined. This post-restoration noise reduction is often performed when work...

We study the problem of reaching a consensus in the estimates of multiple agents forming a network with time-varying connectivity. Our main focus is on constrained consensus problems where the estimate of each agent is constrained to lie in a different closed convex constraint set. We consider a distributed “projected consensus algorithm” in which the local averaging operation is combined with ...

The CFLP scheme for Constraint Functional Logic Programming has instances CFLP (D) corresponding to different constraint domains D. In this paper, we propose an amalgamated sum construction for building coordination domains C, suitable to represent the cooperation among several constraint domains D1, . . . ,Dn via a mediatorial domain M. Moreover, we present a cooperative goal solving calculus ...

Class Domain Main fields V: Variable variable associated with this domain Main methods abstract boolean isEmpty() returns true iff the domain is empty abstract List discretize() returns a discrete representation of the domain (a list of values) Domain clone() returns a copy of the Domain object abstract void setSingleValue(in val:Value) reduce domain to a single value Table 3. Domain cla...

Combining new constraints on future socio-economic trajectories and the climate system's response to emissions can substantially reduce projection uncertainty currently clouding regional adaptation decisions—more than either constraint individually.

This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional Zinkevich’s projection based online algorithm (Zinkevich 2013) can be difficult to implement due to the potentially high computation complexity of the projection operation. In this paper, we relax the functional con...