Heinz H. Bauschke

Shambhavi Singh

SIAM J. Optim., 2023

2022

The Bregman Proximal Average.

[BibT_eX]

[DOI]

SIAM J. Optim., 2022

Best approximation mappings in Hilbert spaces.

[BibT_eX]

[DOI]

Hui Ouyang

Math. Program., 2022

Finding best approximation pairs for two intersections of closed convex sets.

[BibT_eX]

[DOI]

Shambhavi Singh

Comput. Optim. Appl., 2022

2021

Edelstein's Astonishing Affine Isometry.

[BibT_eX]

[DOI]

Am. Math. Mon., 2021

Attouch-Théra Duality, Generalized Cycles, and Gap Vectors.

[BibT_eX]

[DOI]

Salihah Alwadani

SIAM J. Optim., 2021

The difference vectors for convex sets and a resolution of the geometry conjecture.

[BibT_eX]

[DOI]

Open J. Math. Optim., 2021

On the linear convergence of circumcentered isometry methods.

[BibT_eX]

[DOI]

Hui Ouyang

Numer. Algorithms, 2021

Generalized monotone operators and their averaged resolvents.

[BibT_eX]

[DOI]

Math. Program., 2021

Multi-marginal maximal monotonicity and convex analysis.

[BibT_eX]

[DOI]

Math. Program., 2021

The projection onto the cross.

[BibT_eX]

[DOI]

Manish Krishan Lal

CoRR, 2021

2020

On the Behavior of the Douglas-Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections.

[BibT_eX]

[DOI]

Regina Sandra Burachik

Daniel B. Herman

C. Yalçin Kaya

Optim. Lett., 2020

Applying FISTA to optimization problems (with or) without minimizers.

[BibT_eX]

[DOI]

Minh N. Bùi

Math. Program., 2020

On the Minimal Displacement Vector of Compositions and Convex Combinations of Nonexpansive Mappings.

[BibT_eX]

[DOI]

Found. Comput. Math., 2020

2019

On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2019

The Douglas-Rachford algorithm for a hyperplane and a doubleton.

[BibT_eX]

[DOI]

Scott B. Lindstrom

J. Glob. Optim., 2019

On sums and convex combinations of projectors onto convex sets.

[BibT_eX]

[DOI]

Minh N. Bùi

J. Approx. Theory, 2019

2018

Regularizing with Bregman-Moreau Envelopes.

[BibT_eX]

[DOI]

Scott B. Lindstrom

SIAM J. Optim., 2018

Projecting onto the Intersection of a Cone and a Sphere.

[BibT_eX]

[DOI]

Minh N. Bùi

SIAM J. Optim., 2018

On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2018

The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings.

[BibT_eX]

[DOI]

Optim. Lett., 2018

On Douglas-Rachford operators that fail to be proximal mappings.

[BibT_eX]

[DOI]

Jason Schaad

Math. Program., 2018

2017

On the Finite Convergence of the Douglas-Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces.

[BibT_eX]

[DOI]

SIAM J. Optim., 2017

The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau.

[BibT_eX]

[DOI]

Sedi Bartz

SIAM J. Optim., 2017

On the Douglas-Rachford algorithm.

[BibT_eX]

[DOI]

Math. Program., 2017

A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications.

[BibT_eX]

[DOI]

Jérôme Bolte

Marc Teboulle

Math. Oper. Res., 2017

2016

The Douglas-Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces.

[BibT_eX]

[DOI]

SIAM J. Optim., 2016

The Resolvent Average of Monotone Operators: Dominant and Recessive Properties.

[BibT_eX]

[DOI]

SIAM J. Optim., 2016

The Douglas-Rachford algorithm in the affine-convex case.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2016

On the order of the operators in the Douglas-Rachford algorithm.

[BibT_eX]

[DOI]

Optim. Lett., 2016

Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces.

[BibT_eX]

[DOI]

José Yunier Bello Cruz

Tran T. A. Nghia

Hung M. Phan

Numer. Algorithms, 2016

On the Range of the Douglas-Rachford Operator.

[BibT_eX]

[DOI]

Warren L. Hare

Math. Oper. Res., 2016

On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization.

[BibT_eX]

[DOI]

Valentin R. Koch

Hung M. Phan

Oper. Res., 2016

2015

On Subgradient Projectors.

[BibT_eX]

[DOI]

SIAM J. Optim., 2015

A derivative-free comirror algorithm for convex optimization.

[BibT_eX]

[DOI]

Warren L. Hare

Optim. Methods Softw., 2015

On the Finite Convergence of a Projected Cutter Method.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

2014

Generalized Solutions for the Sum of Two Maximally Monotone Operators.

[BibT_eX]

[DOI]

Warren L. Hare

SIAM J. Control. Optim., 2014

The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle.

[BibT_eX]

[DOI]

José Yunier Bello Cruz

Tran T. A. Nghia

Hung M. Phan

J. Approx. Theory, 2014

Restricted Normal Cones and Sparsity Optimization with Affine Constraints.

[BibT_eX]

[DOI]

Found. Comput. Math., 2014

2013

Preface.

[BibT_eX]

[DOI]

Michel Théra

Henry Wolkowicz

Math. Program., 2013

Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings.

[BibT_eX]

[DOI]

Sarah M. Moffat

Math. Program., 2013

2012

Fixed Points of Averages of Resolvents: Geometry and Algorithms.

[BibT_eX]

[DOI]

Calvin J. S. Wylie

SIAM J. Optim., 2012

Every maximally monotone operator of Fitzpatrick-Phelps type is actually of dense type.

[BibT_eX]

[DOI]

Optim. Lett., 2012

Attouch-Théra duality revisited: Paramonotonicity and operator splitting.

[BibT_eX]

[DOI]

J. Approx. Theory, 2012

2011

Convex Analysis and Monotone Operator Theory in Hilbert Spaces

[BibT_eX]

[DOI]

CMS Books in Mathematics, Springer, ISBN: 978-1-4419-9467-7, 2011

Self-Dual Smooth Approximations of Convex Functions via the Proximal Average.

[BibT_eX]

[DOI]

Sarah M. Moffat

Proceedings of the Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 2011

Chebyshev Sets, Klee Sets, and Chebyshev Centers with Respect to Bregman Distances: Recent Results and Open Problems.

[BibT_eX]

[DOI]

Mason S. Macklem

Proceedings of the Fixed-Point Algorithms for Inverse Problems in Science and Engineering, 2011

2010

On Borwein--Wiersma Decompositions of Monotone Linear Relations.

[BibT_eX]

[DOI]

Liangjin Yao

SIAM J. Optim., 2010

Autoconjugate representers for linear monotone operators.

[BibT_eX]

[DOI]

Liangjin Yao

Math. Program., 2010

Klee sets and Chebyshev centers for the right Bregman distance.

[BibT_eX]

[DOI]

J. Approx. Theory, 2010

2009

A Note on the Paper by Eckstein and Svaiter on "General Projective Splitting Methods for Sums of Maximal Monotone Operators".

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2009

Bregman distances and Chebyshev sets.

[BibT_eX]

[DOI]

J. Approx. Theory, 2009

Bregman distances and Klee sets.

[BibT_eX]

[DOI]

J. Approx. Theory, 2009

Characterizing arbitrarily slow convergence in the method of alternating projections.

[BibT_eX]

[DOI]

Frank Deutsch

Hein Hundal

Int. Trans. Oper. Res., 2009

The piecewise linear-quadratic model for computational convex analysis.

[BibT_eX]

[DOI]

Yves Lucet

Mike Trienis

Comput. Optim. Appl., 2009

2008

How to Transform One Convex Function Continuously into Another.

[BibT_eX]

[DOI]

Yves Lucet

Michael Trienis

SIAM Rev., 2008

The Proximal Average: Basic Theory.

[BibT_eX]

[DOI]

SIAM J. Optim., 2008

2007

Fitzpatrick Functions and Continuous Linear Monotone Operators.

[BibT_eX]

[DOI]

SIAM J. Optim., 2007

Primal-Dual Symmetric Intrinsic Methods for Finding Antiderivatives of Cyclically Monotone Operators.

[BibT_eX]

[DOI]

Yves Lucet

SIAM J. Control. Optim., 2007

2006

Extrapolation algorithm for affine-convex feasibility problems.

[BibT_eX]

[DOI]

Serge G. Kruk

Numer. Algorithms, 2006

A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space.

[BibT_eX]

[DOI]

J. Approx. Theory, 2006

Symbolic computation of Fenchel conjugates.

[BibT_eX]

[DOI]

Martin von Mohrenschildt

ACM Commun. Comput. Algebra, 2006

A Decomposition Method for Nonsmooth Convex Variational Signal Recovery.

[BibT_eX]

[DOI]

Jean-Christophe Pesquet

Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

2005

A new generation of iterative transform algorithms for phase contrast tomography.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004

Finding best approximation pairs relative to two closed convex sets in Hilbert spaces.

[BibT_eX]

[DOI]

J. Approx. Theory, 2004

2003

Recompression of JPEG images by requantization.

[BibT_eX]

[DOI]

Christopher H. Hamilton

Mason S. Macklem

Justin S. McMichael

Nicholas R. Swart

IEEE Trans. Image Process., 2003

Iterating Bregman Retractions.

[BibT_eX]

[DOI]

SIAM J. Optim., 2003

Bregman Monotone Optimization Algorithms.

[BibT_eX]

[DOI]

SIAM J. Control. Optim., 2003

Duality for Bregman projections onto translated cones and affine subspaces.

[BibT_eX]

[DOI]

J. Approx. Theory, 2003

2002

On the structure of some phase retrieval algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2002 International Conference on Image Processing, 2002

A requantization-based method for recompressing JPEG images.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2002

2001

A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces.

[BibT_eX]

[DOI]

Math. Oper. Res., 2001

1999

An EM-Algorithm for Dynamic SPECT.

[BibT_eX]

[DOI]

IEEE Trans. Medical Imaging, 1999

Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization.

[BibT_eX]

[DOI]

Wu Li

Math. Program., 1999

1996

On Projection Algorithms for Solving Convex Feasibility Problems.

[BibT_eX]

[DOI]