Related papers: The augmented Lagrangian method as a framework for…
We propose to use a hybridizable discontinuous Galerkin (HDG) method combined with the continuous Galerkin (CG) method to approximate Maxwell's equations. We make two contributions in this paper. First, even though there are many papers…
We propose and analyze a pressure-stabilized projection Lagrange--Galerkin scheme for the transient Oseen problem. The proposed scheme inherits the following advantages from the projection Lagrange--Galerkin scheme. The first advantage is…
In this work a local projection stabilization method is proposed to solve a fictitious domain problem. The method adds a suitable fluctuation term to the formulation thus rendering the natural space for the Lagrange multiplier stable.…
We present preconditioning techniques to solve linear systems of equations with a block two-by-two and three-by-three structure arising from finite element discretizations of the fictitious domain method with Lagrange multipliers. In…
Constrained optimization problems exist in many domains of science, such as thermodynamics, mechanics, economics, etc. These problems are classically solved with the help of the Lagrange multipliers and the Lagrangian function. However, the…
We develop a decomposition method based on the augmented Lagrangian framework to solve a broad family of semidefinite programming problems, possibly with nonlinear objective functions, nonsmooth regularization, and general linear…
A gauge independent method of obtaining the reduced space of constrained dynamical systems is discussed in a purely lagrangian formalism. Implications of gauge fixing are also considered.
We provide a simplified form of Primal Augmented Lagrange Multiplier algorithm. We intend to fill the gap in the steps involved in the mathematical derivations of the algorithm so that an insight into the algorithm is made. The experiment…
Lagrange multipliers are present in any gauge theory. They possess peculiar gauge transformation which is not generated by the constraints in the model as it is the case with the other variables. For rank one gauge theories we show how to…
This paper studies a recovery task of finding a low multilinear-rank tensor that fulfills some linear constraints in the general settings, which has many applications in computer vision and graphics. This problem is named as the low…
In the Reduced Basis approximation of Stokes and Navier-Stokes problems, the Galerkin projection on the reduced spaces does not necessarily preserved the inf-sup stability even if the snapshots were generated through a stable full order…
Generalized nonlinear programming is considered without any convexity assumption, capturing a variety of problems that include nonsmooth objectives, combinatorial structures, and set-membership nonlinear constraints. We extend the augmented…
A novel augmented Lagrangian method for solving non-convex programs with nonlinear cost and constraint couplings in a distributed framework is presented. The proposed decomposition algorithm is made of two layers: The outer level is a…
A new stabilizer free weak Galerkin (WG) method is introduced and analyzed for the biharmonic equation. Stabilizing/penalty terms are often necessary in the finite element formulations with discontinuous approximations to ensure the…
In this paper, we propose a penalty dual-primal augmented lagrangian method for solving convex minimization problems under linear equality or inequality constraints. The proposed method combines a novel penalty technique with updates the…
Constrained optimization offers a powerful framework to prescribe desired behaviors in neural network models. Typically, constrained problems are solved via their min-max Lagrangian formulations, which exhibit unstable oscillatory dynamics…
This paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex. We propose an asynchronous distributed optimization algorithm, relying on the centralized Method…
We consider solving the Laplace-Beltrami problem on a smooth two dimensional surface embedded into a three dimensional space meshed with tetrahedra. The mesh does not respect the surface and thus the surface cuts through the elements. We…
Error estimates with optimal convergence orders are proved for a stabilized Lagrange-Galerkin scheme for the Navier-Stokes equations. The scheme is a combination of Lagrange-Galerkin method and Brezzi-Pitkaranta's stabilization method. It…
First-order methods have been popularly used for solving large-scale problems. However, many existing works only consider unconstrained problems or those with simple constraint. In this paper, we develop two first-order methods for…