Results 31 to 40 of about 243 (58)
A Total Variation Diminishing Interpolation Operator and Applications [PDF]
arXiv, 2012 We construct, on continuous $Q_1$ finite elements over Cartesian meshes, an interpolation operator that does not increase the total variation. The operator is stable in $L^1$ and exhibits second order approximation properties. With the help of it we provide improved error estimates for discrete minimizers of the total variation denoising problem and ...
arxiv
A Generalized Finite Element Method for the Obstacle Problem of Plates [PDF]
arXiv, 2012 A generalized finite element method for the displacement obstacle problem of clamped Kirchhoff plates is considered in this paper. We derive optimal error estimates and present numerical results that illustrate the performance of the method.
arxiv
Interpolation for completely positive maps: numerical solutions [PDF]
arXiv, 2014 We present certain techniques to find completely positive maps between matrix algebras that take prescribed values on given data. To this aim we describe a semidefinite programming approach and another convex minimization method supported by a numerical example.
arxiv
EURO Journal on Computational Optimization, 2019 The plain Newton-min algorithm for solving the linear complementarity problem (LCP) “0⩽x⊥(Mx+q)⩾0” can be viewed as an instance of the plain semismooth Newton method on the equational version “min(x,Mx+q)=0” of the problem.
Jean-Pierre Dussault +2 more
doaj
Finite element approximation of an obstacle problem for a class of integro-differential operators [PDF]
arXiv, 2018 We study the regularity of the solution to an obstacle problem for a class of integro-differential operators. The differential part is a second order elliptic operator, whereas the nonlocal part is given by the integral fractional Laplacian. The obtained smoothness is then used to design and analyze a finite element scheme.
arxiv
Hybrid algorithms without the extra-steps for equilibrium problems [PDF]
arXiv, 2015 In this paper, we introduce some new hybrid algorithms for finding a solution of a system of equilibrium problems. In these algorithms, by constructing specially cutting-halfspaces, we avoid using the extra-steps as in the extragradient method and the Armijo linesearch method which are inherently costly when the feasible set has a complex structure ...
arxiv
A Simplified Convex Optimization Model for Image Restoration with Multiplicative Noise. [PDF]
J Imaging, 2023 Che H, Tang Y.
europepmc +1 more source
Outer approximation method for constrained composite fixed point problems involving Lipschitz pseudo contractive operators [PDF]
arXiv, 2011 We propose a method for solving constrained fixed point problems involving compositions of Lipschitz pseudo contractive and firmly nonexpansive operators in Hilbert spaces. Each iteration of the method uses separate evaluations of these operators and an outer approximation given by the projection onto a closed half-space containing the constraint set ...
arxiv
A numerical method for variational problems with convexity constraints [PDF]
arXiv, 2011 We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational problems, and partial differential equation techniques.
arxiv
Discrete Total Variation Flows Without Regularization [PDF]
arXiv, 2012 We propose and analyze an algorithm for the solution of the $L^2$-subgradient flow of the total variation functional. The algorithm involves no regularization, thus the numerical solution preserves the main features that motivate practitioners to consider this type of energy. We propose an iterative scheme for the solution of the arising problems, show
arxiv