Related papers: Nonlinear and degenerate discounted approximation …

This paper deals with the discrete system being the finite-difference approximation of the Sturm-Liouville problem with frozen argument. The inverse problem theory is developed for this discrete system. We describe the two principal cases:…

We consider resolvent splitting algorithms for finding a zero of the sum of finitely many maximally monotone operators. The standard approach to solving this type of problem involves reformulating as a two-operator problem in the…

We establish sharp energy decay rates for a large class of nonlinearly first-order damped systems, and we design discretization schemes that inherit of the same energy decay rates, uniformly with respect to the space and/or time…

We consider a class of fully nonlinear nonlocal degenerate elliptic operators which are modeled on the fractional Laplacian and converge to the truncated Laplacians. We investigate the validity of (strong) maximum and minimum principles,…

Here, we study the selection problem for the vanishing discount approximation of non-convex, first-order Hamilton-Jacobi equations. While the selection problem is well understood for convex Hamiltonians, the selection problem for non-convex…

We propose an alternating optimization algorithm to the nonconvex Koopman operator learning problem for nonlinear dynamic systems. We show that the proposed algorithm will converge to a critical point with rate $O(1/T)$ and $O(\frac{1}{\log…

We obtain a unique continuation result at infinity for fully nonlinear elliptic integro-differential operators of order 2s which satisfy the maximum and minimum principles in bounded subdomains, under the decay assumption $o(|x|^{-(N+2s)})$…

We study an abstract second order inclusion involving two nonlinear single-valued operators and a nonlinear multivalued term. Our goal is to establish the existence of solutions to the problem by applying numerical scheme based on time…

This paper introduces a second-order differential inclusion for unconstrained convex optimization. In continuous level, solution existence in proper sense is obtained and exponential decay of a novel Lyapunov function along with the…

Firstly, we invoke the weak convergence (resp. strong convergence) of translated basic methods involving nonexpansive operators to establish the weak convergence (resp. strong convergence) of the associated method with both perturbation and…

We systematically introduce the idea of applying differential operator method to find a particular solution of an ordinary nonhomogeneous linear differential equation with constant coefficients when the nonhomogeneous term is a polynomial…

This paper presents and investigates an inexact proximal gradient method for solving composite convex optimization problems characterized by an objective function composed of a sum of a full-domain differentiable convex function and a…

This paper proposes a novel preconditioned implicit-explicit algorithm enhanced with the extrapolation technique for non-convex optimization problems. The algorithm employs a third-order Adams-Bashforth scheme for the nonlinear and explicit…

We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap…

We consider a weakly coupled system of discounted Hamilton--Jacobi equations set on a closed Riemannian manifold. We prove that the corresponding solutions converge to a specific solution of the limit system as the discount factor goes to…

Weak KAM theory for discount Hamilton-Jacobi equations and corresponding discount Lagrangian/Hamiltonian dynamics is developed. Then it is applied to error estimates for viscosity solutions in the vanishing discount process. The main…

This work studies a class of non-smooth decentralized multi-agent optimization problems where the agents aim at minimizing a sum of local strongly-convex smooth components plus a common non-smooth term. We propose a general primal-dual…

In this paper, we focus on solving a class of constrained non-convex non-concave saddle point problems in a decentralized manner by a group of nodes in a network. Specifically, we assume that each node has access to a summand of a global…

This work investigates the properties of the proximity operator for quasar-convex functions and establishes the convergence of the proximal point algorithm to a global minimizer with a particular focus on its convergence rate. In…

We will make a link between the steepest descent method for an unconstrained minimisation problem and fixed-point iterations for its Euler-Lagrange equation. In this context, we shall rediscover the preconditioned nonlinear conjugate…