Related papers: Parallel hybrid extragradient methods for pseudomo…
A general primal-dual splitting algorithm for solving systems of structured coupled monotone inclusions in Hilbert spaces is introduced and its asymptotic behavior is analyzed. Each inclusion in the primal system features compositions with…
This paper studies the iteration-complexity of new regularized hybrid proximal extragradient (HPE)-type methods for solving monotone inclusion problems (MIPs). The new (regularized HPE-type) methods essentially consist of instances of the…
A multi-cube method is developed for solving systems of elliptic and hyperbolic partial differential equations numerically on manifolds with arbitrary spatial topologies. It is shown that any three-dimensional manifold can be represented as…
In this paper, we design and analyze a Hybrid-High Order (HHO) approximation for a class of quasilinear elliptic problems of nonmonotone type. The proposed method has several advantages, for instance, it supports arbitrary order of…
In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…
Systems of polynomial equations arise frequently in computer vision, especially in multiview geometry problems. Traditional methods for solving these systems typically aim to eliminate variables to reach a univariate polynomial, e.g., a…
Quasi-equilibrium approximation is a widely used closure approximation approach for model reduction with applications in complex fluids, materials science, etc. It is based on the maximum entropy principle and leads to thermodynamically…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
In this paper we consider parallelization for applications whose objective can be expressed as maximizing a non-monotone submodular function under a cardinality constraint. Our main result is an algorithm whose approximation is arbitrarily…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some output variables are also input variables, linked by a linear dependency. Fundamental examples include the…
In this article, we consider nonlinear complementarity problem. We introduce a new homotopy function for finding the solution of nonlinear complementarity problem through the trajectory . We show that the homotopy path approaching the…
This paper establishes quasi-optimal and lower-order error estimates for weak Galerkin, discontinuous Galerkin, and hybrid-high order finite element methods for the biharmonic equation under minimal regularity assumptions on general…
Aussel et al. (J Optim Theory Appl 170 818-837 2016) introduced the concept of projected solutions for the quasi-variational inequalities with a non-self constraint map, that is, the case where the constraint map may take values outside the…
In this paper, a scalable iterative projection-type algorithm for solving non-stationary systems of linear inequalities is considered. A non-stationary system is understood as a large-scale system of inequalities in which coefficients and…
The present review presents the authors previous results on the topic from the title in a new light. Most of the previous results were obtained using the techniques of antilinear Hilbert-Schmidt mappings of one Hilbert pace into another,…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
Some numerical algorithms for elliptic eigenvalue problems are proposed, analyzed, and numerically tested. The methods combine advantages of the two-grid algorithm, two-space method, the shifted inverse power method, and the polynomial…
Homotopy optimization is a traditional method to deal with a complicated optimization problem by solving a sequence of easy-to-hard surrogate subproblems. However, this method can be very sensitive to the continuation schedule design and…
In this work, we study the convergence and performance of nonlinear solvers for the Bidomain equations after decoupling the ordinary and partial differential equations of the cardiac system. Firstly, we provide a rigorous proof of the…
In this paper we describe a 1-dimensional variational approach to the analytical construction of equivariant biharmonic maps. Our goal is to provide a direct method which enables analysts to compute directly the analytical conditions which…