Related papers: Fast operator splitting methods for obstacle probl…
We study the obstacle problem with an elliptic operator in divergence form. We develop all of the basic theory of existence, uniqueness, optimal regularity, and nondegeneracy of the solutions. These results, in turn, allow us to begin the…
The three-operators splitting algorithm is a popular operator splitting method for finding the zeros of the sum of three maximally monotone operators, with one of which is cocoercive operator. In this paper, we propose a class of inertial…
In this paper, we investigate optimal control problems governed by semilinear elliptic variational inequalities involving constraints on the state, and more precisely the obstacle problem. Since we adopt a numerical point of view, we first…
Trajectory optimization methods provide an efficient and reliable means of computing feasible trajectories in nonconvex solution spaces. However, a well-known limitation of these algorithms is that they are inherently local in nature, and…
We consider the problem of minimizing the sum of a smooth function $h$ with a bounded Hessian, and a nonsmooth function. We assume that the latter function is a composition of a proper closed function $P$ and a surjective linear map $\cal…
The classical Minkowski problem for convex bodies has deeply influenced the development of differential geometry. During the past several decades, abundant mathematical theories have been developed for studying the solutions of the…
Three Operator Splitting (TOS) (Davis & Yin, 2017) can minimize the sum of multiple convex functions effectively when an efficient gradient oracle or proximal operator is available for each term. This requirement often fails in machine…
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they…
We consider the constrained Linear Inverse Problem (LIP), where a certain atomic norm (like the $\ell_1 $ norm) is minimized subject to a quadratic constraint. Typically, such cost functions are non-differentiable, which makes them not…
In this paper we consider a mixed boundary value problem with a nonhomogeneous, nonlinear differential operator (called double phase operator), a nonlinear convection term (a reaction term depending on the gradient), three multivalued terms…
Unconstrained optimization problems become more common in scientific computing and engineering applications with the rapid development of artificial intelligence, and numerical methods for solving them more quickly and efficiently have been…
Vlasov equations model the dynamics of plasma in the collisionless regime. A standard approach for numerically solving the Vlasov equation is to operator split the spatial and velocity derivative terms, allowing simpler time-stepping…
Splitting methods constitute a well-established class of numerical schemes for solving convection-diffusion-reaction problems. They have been shown to be effective in solving problems with periodic boundary conditions. However, in the case…
Consider the scattering of a time-harmonic plane wave by a rigid obstacle embedded in a homogeneous and isotropic elastic medium in two dimensions. In this paper, a novel boundary integral formulation is proposed and its highly accurate…
We consider the numerical integration of non-autonomous separable parabolic equations using high order splitting methods with complex coefficients (methods with real coefficients of order greater than two necessarily have negative…
An efficient geometric integrator is proposed for solving the perturbed Kepler motion. This method is stable and accurate over long integration time, which makes it appropriate for treating problems in astrophysics, like solar system…
Generating time-optimal, collision-free trajectories for autonomous mobile robots involves a fundamental trade-off between guaranteeing safety and managing computational complexity. State-of-the-art approaches formulate spline-based motion…
Splitting methods constitute a well-established class of numerical schemes for the time integration of partial differential equations. Their main advantages over more traditional schemes are computational efficiency and superior geometric…
In this paper we consider various splitting schemes for unsteady problems containing the grad-div operator. The fully implicit discretization of such problems would yield at each time step a linear problem that couples all components of the…
In this paper, we propose two algorithms for solving convex optimization problems with linear ascending constraints. When the objective function is separable, we propose a dual method which terminates in a finite number of iterations. In…