相关论文: Application of projection algorithms to differenti…
This short note presents some variant schemes of boundary variation diminishing (BVD) algorithm in one dimension with the results of numerical tests for linear advection equation to facilitate practical use. In spite of being presented in…
Finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional diffusion equations with an obstacle term, of the form $$\min(v_t - a(t,x) v_{xx} + b(t,x) v_x + r(t,x) v, v-…
In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem. We focus on the general setting in which both the upper-…
In this paper, we consider convex feasibility problems where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal…
The level set method is a widely used tool for solving reachability and invariance problems. However, some shortcomings, such as the difficulties of handling dissipation function and constructing terminal conditions for solving the…
Solutions of boundary value problems for a diffusion equation of fractional and variable order in differential and difference settings are studied. It is shown that the method of energy inequalities is applicable to obtaining a priori…
A new formulation of boundary value problems in gradient elasticity is presented in this work. The main outcome is the construction of partial differential systems of second order, which are typically equivalent with the well known fourth…
In this paper, we design a neural network architecture to approximate the weakly efficient frontier of convex vector optimization problems (CVOP) satisfying Slater's condition. The proposed machine learning methodology provides both an…
This paper presents a novel methodology for evaluating the boundedness, stability, and instability of some vector nonlinear systems with multiple time-varying delays and variable coefficients. The proposed technique develops two scalar…
We provide a simple analysis of the Douglas-Rachford splitting algorithm in the context of $\ell^1$ minimization with linear constraints, and quantify the asymptotic linear convergence rate in terms of principal angles between relevant…
We are interested in restoring images having values in a symmetric Hadamard manifold by minimizing a functional with a quadratic data term and a total variation like regularizing term. To solve the convex minimization problem, we extend the…
In this article we prove solvability results for $L^2$ boundary value problems of some elliptic systems $Lu=0$ on the upper half-space $\R^{n+1}_{+}, n\ge 1$, with transversally independent coefficients. We use the first order formalism…
We use a numerical-analytic technique to construct a sequence of successive approximations to the solution of a system of fractional differential equations, subject to Dirichlet boundary conditions. We prove the uniform convergence of the…
In this paper, we propose a review of the free boundary formulation for BVPs defined on semi-infinite intervals. The main idea and theorem are illustrated, for the reader convenience, by using a class of second-order BVPs. Moreover, we are…
In this paper we present a theory for the existence of multiple nontrivial solutions for a class of perturbed Hammerstein integral equations. Our methodology, rather than to work directly in cones, is to utilize the theory of fixed point…
We consider a multi-objective risk-averse two-stage stochastic programming problem with a multivariate convex risk measure. We suggest a convex vector optimization formulation with set-valued constraints and propose an extended version of…
In recent years, the Douglas-Rachford splitting method has been shown to be effective at solving many non-convex optimization problems. In this paper we present a local convergence analysis for non-convex feasibility problems and show that…
Finding a point in the intersection of a collection of closed convex sets, that is the convex feasibility problem, represents the main modeling strategy for many computational problems. In this paper we analyze new stochastic reformulations…
The Continuous p-Dispersion Problem (CpDP) with boundary constraints asks for the placement of a fixed number of points in a compact subset of Euclidean space such that the minimum distance between any two points, as well as the points and…
In this work two-point boundary value problem for one class of second order ordinary differential equations with variable coefficients is solved.