Related papers: On Adaptive Grad-Div Parameter Selection
We consider an optimization problem with strongly convex objective and linear inequalities constraints. To be able to deal with a large number of constraints we provide a penalty reformulation of the problem. As penalty functions we use a…
We study topology optimization governed by the incompressible Navier-Stokes flows using a phase field model. Novel stabilized semi-implicit schemes for the gradient flows of Allen-Cahn and Cahn-Hilliard types are proposed for solving the…
We present a component-based model order reduction procedure to efficiently and accurately solve parameterized incompressible flows governed by the Navier-Stokes equations. Our approach leverages a non-overlapping optimization-based domain…
This paper is concerned with the problem of shape optimization of two-dimensional flows governed by the time-dependent Navier-Stokes equations. We derive the structures of shape gradients with respect to the shape of the variable domain for…
The motivation for this paper stems from the desire to develop an adaptive sampling method for solving constrained optimization problems in which the objective function is stochastic and the constraints are deterministic. The method…
The parameters of a neural network are naturally organized in groups, some of which might not contribute to its overall performance. To prune out unimportant groups of parameters, we can include some non-differentiable penalty to the…
This paper presents and analyzes two robust, efficient, and optimally accurate fully discrete finite element algorithms for computing the parameterized Navier-Stokes Equations (NSEs) flow ensemble. The timestepping algorithms are…
Common efficient schemes for the incompressible Navier-Stokes equations, such as projection or fractional step methods, have limited temporal accuracy as a result of matrix splitting errors, or introduce errors near the domain boundaries…
We propose an adaptive accelerated gradient method for solving smooth convex optimization problems. The method incorporates a scheme to determine the step size adaptively, by means of a local estimation of the smoothness constant, which is…
This paper considers an enhancement of the classical iterated penalty Picard (IPP) method for the incompressible Navier-Stokes equations, where we restrict our attention to $O(1)$ penalty parameter, and Anderson acceleration (AA) is used to…
In this article, we present a cut finite element method for two-phase Navier-Stokes flows. The main feature of the method is the formulation of a unified continuous interior penalty stabilisation approach for, on the one hand, stabilising…
A new family of penalty functions, adaptive to likelihood, is introduced for model selection in general regression models. It arises naturally through assuming certain types of prior distribution on the regression parameters. To study…
In many applications, uncertainty in problem data leads to the need for numerous computationally expensive simulations. This report addresses this challenge by developing a penalty-based ensemble algorithm. Building upon Jiang and Layton's…
We study the problem of estimating from data, a sparse approximation to the inverse covariance matrix. Estimating a sparsity constrained inverse covariance matrix is a key component in Gaussian graphical model learning, but one that is…
The Adaptive Multilevel Splitting algorithm is a very powerful and versatile method to estimate rare events probabilities. It is an iterative procedure on an interacting particle system, where at each step, the $k$ less well-adapted…
This paper develops an adaptive proximal alternating direction method of multipliers (ADMM) for solving linearly constrained, composite optimization problems under the assumption that the smooth component of the objective is weakly convex,…
This paper presents a new parameter estimation algorithm for the adaptive control of a class of time-varying plants. The main feature of this algorithm is a matrix of time-varying learning rates, which enables parameter estimation error…
In this article, we analyze a two-level finite element method for the two dimensional time-dependent incompressible Navier-Stokes equations with non-smooth initial data. It involves solving the non-linear Navier-Stokes problem on a coarse…
Stochastic gradient algorithms are the main focus of large-scale optimization problems and led to important successes in the recent advancement of the deep learning algorithms. The convergence of SGD depends on the careful choice of…
In this paper, we study the problem concerning the approximation of a rigid obstacle for flows governed by the stationary Navier-Stokes equations in the two-dimensional case. The idea is to consider a highly viscous fluid in the place of…