1 citations · 1 across the 4 of their papers we have counts for
9 papers · 1 filter
An adaptive splitting algorithm for the sum of three operators
Minh N. Dao, Hung M. Phan
Splitting algorithms for finding a zero of sum of operators often involve multiple steps which are referred to as forward or backward steps. Forward steps are the explicit use of t…
Demiclosedness principles for generalized nonexpansive mappings
Sedi Bartz, Rubén Campoy, Hung M. Phan
Demiclosedness principles are powerful tools in the study of convergence of iterative methods. For instance, a multi-operator demiclosedness principle for firmly nonexpansive mappi…
Conical averagedness and convergence analysis of fixed point algorithms
Sedi Bartz, Minh N. Dao, Hung M. Phan
We study a conical extension of averaged nonexpansive operators and the role it plays in convergence analysis of fixed point algorithms. Various properties of conically averaged op…
Optimization of triangular networks with spatial constraints
Valentin R. Koch, Hung M. Phan
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or g…
Computing the resolvent of the sum of operators with application to best approximation problems
Minh N. Dao, Hung M. Phan
We propose a flexible approach for computing the resolvent of the sum of weakly monotone operators in real Hilbert spaces. This relies on splitting methods where strong convergence…
Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
Minh N. Dao, Hung M. Phan
The Douglas-Rachford algorithm is a classical and powerful splitting method for minimizing the sum of two convex functions and, more generally, finding a zero of the sum of two max…