Related papers: Convergence results with natural norms: Stabilized…
We prove Lipschitz continuity results for solutions to a class of obstacle problems under standard growth conditions of $p$-type, $p \geq 2$. The main novelty is the use of a linearization technique going back to [28] in order to interpret…
A second order accurate numerical scheme is proposed and implemented for the Landau-Lifshitz-Gilbert equation, which models magnetization dynamics in ferromagnetic materials, with large damping parameters. The main advantages of this method…
In this paper we consider from two different aspects the proximal alternating direction method of multipliers (ADMM) in Hilbert spaces. We first consider the application of the proximal ADMM to solve well-posed linearly constrained…
There has been a recent interest in imitation learning methods that are guaranteed to produce a stabilizing control law with respect to a known system. Work in this area has generally considered linear systems and controllers, for which…
In this paper we study the existence of multiple normalized solutions to the following class of elliptic problems \begin{align*} \left\{ \begin{aligned} &-\epsilon^2\Delta u+V(x)u=\lambda u+f(u), \quad \quad \hbox{in }\mathbb{R}^N,…
We propose first-order pressure-correction scheme for the incompressible Navier-Stokes equations, incorporating the recently developed the Dynamically Regularized Lagrange Multiplier (DRLM) methods. The resulting algorithms are fully…
In this paper a higher-order mixed finite element method for elastoplasticity with linear kinematic hardening is analyzed. Thereby, the non-differentiability of the involved plasticity functional is resolved by a Lagrange multiplier leading…
This paper develops a robust fixed time optimization framework for constrained problems that guarantees exact constraint satisfaction and convergence to KKT points within fixed time , independent of initial conditions. The approach treats…
This paper considers smooth convex optimization problems with many functional constraints. To solve this general class of problems we propose a new stochastic perturbed augmented Lagrangian method, called SGDPA, where a perturbation is…
We propose two basic assumptions, under which the rate of convergence of the augmented Lagrange method for a class of composite optimization problems is estimated. We analyze the rate of local convergence of the augmented Lagrangian method…
The immersed boundary lattice Boltzmann method (IB-LBM) has been widely used in the simulation of fluid-solid interaction and particulate flow problems, since proposed in 2004. However, it is usually a non-trivial task to retain the…
This paper is devoted to the study of acceleration methods for an inequality constrained convex optimization problem by using Lyapunov functions. We first approximate such a problem as an unconstrained optimization problem by employing the…
Decentralized optimization for non-convex problems are now demanding by many emerging applications (e.g., smart grids, smart building, etc.). Though dramatic progress has been achieved in convex problems, the results for non-convex cases,…
Second-order sufficient conditions for local optimality have been playing an important role in local convergence analysis of optimization algorithms. In this paper, we demonstrate that this condition alone suffices to justify the linear…
Local convergence analysis of the augmented Lagrangian method (ALM) is established for a large class of composite optimization problems with nonunique Lagrange multipliers under a second-order sufficient condition. We present a new…
In many applications, SMT solvers are utilized to solve similar or identical tasks over time. Significant variations in performance due to small changes in the input are not uncommon and lead to frustration for users. This sort of stability…
The Lagrange mesh method is a very simple procedure to accurately solve eigenvalue problems starting from a given nonrelativistic or semirelativistic two-body Hamiltonian with local or nonlocal potential. We show in this work that it can be…
In this paper, we focus on nonlinear infinite-norm minimization problems that have many applications, especially in computer science and operations research. We set a reliable Lagrangian dual aproach for solving this kind of problems in…
In the second part of this series, we use the Lagrange multiplier approach proposed in the first part \cite{CheS21} to construct efficient and accurate bound and/or mass preserving schemes for a class of semi-linear and quasi-linear…
For optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL) methods sequentially minimize a Lagrangian function subject to linearized constraints. These methods converge rapidly near a solution but may not be…