6 citations · 11 across the 7 of their papers we have counts for
7 papers
Eckstein-Ferris-Pennanen-Robinson duality revisited: paramonotonicity, total Fenchel-Rockafellar duality, and the Chambolle-Pock operator
Heinz H. Bauschke, Walaa M. Moursi, Shambhavi Singh
Finding zeros of the sum of two maximally monotone operators involving a continuous linear operator is a central problem in optimization and monotone operator theory. We revisit th…
On the Bredies-Chenchene-Lorenz-Naldi algorithm
Heinz H. Bauschke, Walaa M. Moursi, Shambhavi Singh +1
Monotone inclusion problems occur in many areas of optimization and variational analysis. Splitting methods, which utilize resolvents or proximal mappings of the underlying operato…
On Carlier's inequality
Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang
The Fenchel-Young inequality is fundamental in Convex Analysis and Optimization. It states that the difference between certain function values of two vectors and their inner produc…
The splitting algorithms by Ryu, by Malitsky-Tam, and by Campoy applied to normal cones of linear subspaces converge strongly to the projection onto the intersection
Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that the resolvents of the operators are av…
The splitting algorithms by Ryu and by Malitsky-Tam applied to normal cones of linear subspaces converge strongly to the projection onto the intersection
Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang
Finding a zero of a sum of maximally monotone operators is a fundamental problem in modern optimization and nonsmooth analysis. Assuming that resolvents of the operators are availa…
Projecting onto rectangular matrices with prescribed row and column sums
Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang
In 1990, Romero presented a beautiful formula for the projection onto the set of rectangular matrices with prescribed row and column sums. Variants of Romero's formula have been re…
Finding best approximation pairs for two intersections of closed convex sets
Heinz H. Bauschke, Shambhavi Singh, Xianfu Wang
The problem of finding a best approximation pair of two sets, which in turn generalizes the well known convex feasibility problem, has a long history that dates back to work by Che…