Related papers: A Bisection Method to Solve The Elvis Problem With…
We study a rate-independent system with non-convex energy and in the case of a time-discontinuous loading. We prove existence of the rate-dependent viscous regularization by time-incremental problems, while the existence of the so called…
In three space dimensions, we consider the compressible inviscid model describing the time evolution of two fluids sharing the same velocity and enjoying the algebraic pressure closure. By employing the technique of convex integration, we…
A dual hybrid Virtual Element scheme for plane linear elastic problems is presented and analysed. In particular, stability and convergence results have been established. The method, which is first order convergent, has been numerically…
The Einstein-Vlasov-Maxwell (EVM) system can be viewed as a relativistic generalization of the Vlasov-Poisson (VP) system. As it is proved below, one of nice property obeys by the first system is that the strong energy condition holds and…
This paper deals with speeding up the convergence of a class of two-step iterative methods for solving linear systems of equations. To implement the acceleration technique, the residual norm associated with computed approximations for each…
This paper is devoted to the study of a novel mixed Finite Element Method for approximating the solutions of fourth order variational problems subjected to a constraint. The first problem we consider consists in establishing the convergence…
In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function formed as a sum of two terms: one is nonconvex and smooth, and another is convex but simple and its structure is known.…
We propose three iterative methods for solving the Moser-Veselov equation, which arises in the discretization of the Euler-Arnold differential equations governing the motion of a generalized rigid body. We start by formulating the problem…
We propose several new nonsmooth Newton methods for solving convex composite optimization problems with polyhedral regularizers, while avoiding the computation of complicated second-order information on these functions. Under the…
The paper considers a split inverse problem involving component equilibrium problems in Hilbert spaces. This problem therefore is called the split equilibrium problem (SEP). It is known that almost solution methods for solving problem (SEP)…
In this paper we consider the computation of approximate solutions for inverse problems in Hilbert spaces. In order to capture the special feature of solutions, non-smooth convex functions are introduced as penalty terms. By exploiting the…
We introduce a level set based approach to Bayesian geometric inverse problems. In these problems the interface between different domains is the key unknown, and is realized as the level set of a function. This function itself becomes the…
The problem of characterizing the structure of an elastic network constrained to lie on a frozen curved surface appears in many areas of science and has been addressed by many different approaches, most notably, extending linear elasticity…
We consider a general decomposable convex optimization problem. By using right-hand side allocation technique, it can be transformed into a collection of small dimensional optimization problems. The master problem is a convex non-smooth…
We consider some nonlinear elliptic equations on ${\mathbb R}^n$ and ${\mathbb S}^n$. By the method of moving spheres, we obtain the symmetry properties of solutions and some nonexistence results. Moreover, by the global bifurcation theory,…
In this paper, we study the numerical solution of an elastic/viscoelastic wave equation with non smooth wave speed and internal localized distributed Kelvin-Voigt damping acting faraway from the boundary. Our method is based on the Finite…
A version of the globally convergent convexification numerical method is constructed for the problem of Electrical Impedance Tomography in the 2D case. An important element of this version is the presence of the viscosity term. Global…
Lossless Convexification (LCvx) is a convexification technique that transforms a class of nonconvex optimal control problems$\unicode{x2013}$where the nonconvexity arises from a lower bound on the control norm$\unicode{x2013}$into…
In this paper the simplicial cone constrained convex quadratic programming problem is studied. The optimality conditions of this problem consist in a linear complementarity problem. This fact, under a suitable condition, leads to an…
The problem of finding a point in the intersection of closed sets can be solved by the method of alternating projections and its variants. It was shown in earlier papers that for convex sets, the strategy of using quadratic programming (QP)…