default search action
Heinz H. Bauschke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j73]Heinz H. Bauschke, Dayou Mao, Walaa M. Moursi
:
How to project onto the intersection of a closed affine subspace and a hyperplane. Math. Methods Oper. Res. 100(2): 411-435 (2024) - [j72]Heinz H. Bauschke
On the Douglas-Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems. Math. Oper. Res. 49(1): 58-77 (2024) - 2023
- [j71]Heinz H. Bauschke, Manish Krishan Lal
Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces. J. Glob. Optim. 86(1): 25-36 (2023) - [j70]Heinz H. Bauschke, Manish Krishan Lal
Directional asymptotics of Fejér monotone sequences. Optim. Lett. 17(3): 531-544 (2023) - [j69]Heinz H. Bauschke, Shambhavi Singh
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. SIAM J. Optim. 33(2): 739-765 (2023) - 2022
- [j68]Heinz H. Bauschke
Finding best approximation pairs for two intersections of closed convex sets. Comput. Optim. Appl. 81(1): 289-308 (2022) - [j67]Heinz H. Bauschke, Hui Ouyang, Xianfu Wang:
Best approximation mappings in Hilbert spaces. Math. Program. 195(1): 855-901 (2022) - [j66]Xianfu Wang
The Bregman Proximal Average. SIAM J. Optim. 32(2): 1379-1401 (2022) - 2021
- [j65]Sedi Bartz
Multi-marginal maximal monotonicity and convex analysis. Math. Program. 185(1-2): 385-408 (2021) - [j64]Heinz H. Bauschke
Generalized monotone operators and their averaged resolvents. Math. Program. 189(1): 55-74 (2021) - [j63]Heinz H. Bauschke
On the linear convergence of circumcentered isometry methods. Numer. Algorithms 87(1): 263-297 (2021) - [j62]Salihah Alwadani, Heinz H. Bauschke, Julian P. Revalski, Xianfu Wang:
The difference vectors for convex sets and a resolution of the geometry conjecture. Open J. Math. Optim. 2: 1-18 (2021) - [j61]Salihah Alwadani, Heinz H. Bauschke, Xianfu Wang
Attouch-Théra Duality, Generalized Cycles, and Gap Vectors. SIAM J. Optim. 31(3): 1926-1946 (2021) - [j60]Heinz H. Bauschke, Sylvain Gretchko, Walaa M. Moursi, Matthew Saurette:
Edelstein's Astonishing Affine Isometry. Am. Math. Mon. 128(9): 796-809 (2021) - [i3]Heinz H. Bauschke, Manish Krishan Lal, Xianfu Wang:
The projection onto the cross. CoRR abs/2108.04382 (2021) - [i2]Heinz H. Bauschke, Manish Krishan Lal, Xianfu Wang:
Projections onto hyperbolas or bilinear constraint sets in Hilbert spaces. CoRR abs/2112.02181 (2021) - 2020
- [j59]Heinz H. Bauschke
On the Minimal Displacement Vector of Compositions and Convex Combinations of Nonexpansive Mappings. Found. Comput. Math. 20(6): 1653-1666 (2020) - [j58]Heinz H. Bauschke
Applying FISTA to optimization problems (with or) without minimizers. Math. Program. 184(1): 349-381 (2020) - [j57]Heinz H. Bauschke
On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections. Optim. Lett. 14(8): 1975-1987 (2020) - [j56]Heinz H. Bauschke
On the Behavior of the Douglas-Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint. SIAM J. Optim. 30(3): 2559-2576 (2020) - [i1]Heinz H. Bauschke, Regina Sandra Burachik, Daniel B. Herman, C. Yalçin Kaya:
On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections. CoRR abs/2001.06747 (2020)
2010 – 2019
- 2019
- [j55]Heinz H. Bauschke
On sums and convex combinations of projectors onto convex sets. J. Approx. Theory 242: 31-57 (2019) - [j54]Heinz H. Bauschke
The Douglas-Rachford algorithm for a hyperplane and a doubleton. J. Glob. Optim. 74(1): 79-93 (2019) - [j53]Heinz H. Bauschke
On Linear Convergence of Non-Euclidean Gradient Methods without Strong Convexity and Lipschitz Gradient Continuity. J. Optim. Theory Appl. 182(3): 1068-1087 (2019) - 2018
- [j52]Heinz H. Bauschke
On Douglas-Rachford operators that fail to be proximal mappings. Math. Program. 168(1-2): 55-61 (2018) - [j51]Heinz H. Bauschke
The magnitude of the minimal displacement vector for compositions and convex combinations of firmly nonexpansive mappings. Optim. Lett. 12(7): 1465-1474 (2018) - [j50]Salihah Alwadani, Heinz H. Bauschke
On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm. Oper. Res. Lett. 46(6): 585-587 (2018) - [j49]Heinz H. Bauschke
Projecting onto the Intersection of a Cone and a Sphere. SIAM J. Optim. 28(3): 2158-2188 (2018) - [j48]Heinz H. Bauschke
Regularizing with Bregman-Moreau Envelopes. SIAM J. Optim. 28(4): 3208-3228 (2018) - 2017
- [j47]Heinz H. Bauschke
A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications. Math. Oper. Res. 42(2): 330-348 (2017) - [j46]Heinz H. Bauschke
On the Douglas-Rachford algorithm. Math. Program. 164(1-2): 263-284 (2017) - [j45]Sedi Bartz, Heinz H. Bauschke
The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau. SIAM J. Optim. 27(1): 466-477 (2017) - [j44]Heinz H. Bauschke
On the Finite Convergence of the Douglas-Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces. SIAM J. Optim. 27(1): 507-537 (2017) - 2016
- [j43]Heinz H. Bauschke
Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization. Oper. Res. 64(1): 201-218 (2016) - [j42]Heinz H. Bauschke
On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces. J. Glob. Optim. 65(2): 329-349 (2016) - [j41]Heinz H. Bauschke
On the Range of the Douglas-Rachford Operator. Math. Oper. Res. 41(3): 884-897 (2016) - [j40]Heinz H. Bauschke
Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces. Numer. Algorithms 73(1): 33-76 (2016) - [j39]Heinz H. Bauschke
On the order of the operators in the Douglas-Rachford algorithm. Optim. Lett. 10(3): 447-455 (2016) - [j38]Heinz H. Bauschke
The Douglas-Rachford algorithm in the affine-convex case. Oper. Res. Lett. 44(3): 379-382 (2016) - [j37]Sedi Bartz, Heinz H. Bauschke
The Resolvent Average of Monotone Operators: Dominant and Recessive Properties. SIAM J. Optim. 26(1): 602-634 (2016) - [j36]Heinz H. Bauschke
The Douglas-Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces. SIAM J. Optim. 26(2): 968-985 (2016) - 2015
- [j35]Heinz H. Bauschke
On the Finite Convergence of a Projected Cutter Method. J. Optim. Theory Appl. 165(3): 901-916 (2015) - [j34]Heinz H. Bauschke
A derivative-free comirror algorithm for convex optimization. Optim. Methods Softw. 30(4): 706-726 (2015) - [j33]Heinz H. Bauschke
On Subgradient Projectors. SIAM J. Optim. 25(2): 1064-1082 (2015) - 2014
- [j32]Heinz H. Bauschke
Restricted Normal Cones and Sparsity Optimization with Affine Constraints. Found. Comput. Math. 14(1): 63-83 (2014) - [j31]Heinz H. Bauschke
The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle. J. Approx. Theory 185: 63-79 (2014) - [j30]Heinz H. Bauschke
Generalized Solutions for the Sum of Two Maximally Monotone Operators. SIAM J. Control. Optim. 52(2): 1034-1047 (2014) - 2013
- [j29]Heinz H. Bauschke, Michel Théra
Preface. Math. Program. 139(1-2): 1-3 (2013) - [j28]Heinz H. Bauschke
Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings. Math. Program. 139(1-2): 55-70 (2013) - 2012
- [j27]Heinz H. Bauschke
Attouch-Théra duality revisited: Paramonotonicity and operator splitting. J. Approx. Theory 164(8): 1065-1084 (2012) - [j26]Heinz H. Bauschke
Every maximally monotone operator of Fitzpatrick-Phelps type is actually of dense type. Optim. Lett. 6(8): 1875-1881 (2012) - [j25]Heinz H. Bauschke
Fixed Points of Averages of Resolvents: Geometry and Algorithms. SIAM J. Optim. 22(1): 24-40 (2012) - 2011
- [b1]Heinz H. Bauschke, Patrick L. Combettes
Convex Analysis and Monotone Operator Theory in Hilbert Spaces. CMS Books in Mathematics, Springer 2011, ISBN 978-1-4419-9466-0, pp. 1-468 - [p2]Heinz H. Bauschke
Chebyshev Sets, Klee Sets, and Chebyshev Centers with Respect to Bregman Distances: Recent Results and Open Problems. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 1-21 - [p1]Heinz H. Bauschke
Self-Dual Smooth Approximations of Convex Functions via the Proximal Average. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 23-32 - [e1]Heinz H. Bauschke, Regina Sandra Burachik
Fixed-Point Algorithms for Inverse Problems in Science and Engineering. Springer Optimization and Its Applications 49, Springer 2011, ISBN 978-1-4419-9568-1 [contents] - 2010
- [j24]Heinz H. Bauschke
Klee sets and Chebyshev centers for the right Bregman distance. J. Approx. Theory 162(6): 1225-1244 (2010) - [j23]Heinz H. Bauschke
Autoconjugate representers for linear monotone operators. Math. Program. 123(1): 5-24 (2010) - [j22]Heinz H. Bauschke
On Borwein--Wiersma Decompositions of Monotone Linear Relations. SIAM J. Optim. 20(5): 2636-2652 (2010)
2000 – 2009
- 2009
- [j21]Yves Lucet, Heinz H. Bauschke
The piecewise linear-quadratic model for computational convex analysis. Comput. Optim. Appl. 43(1): 95-118 (2009) - [j20]Heinz H. Bauschke
Characterizing arbitrarily slow convergence in the method of alternating projections. Int. Trans. Oper. Res. 16(4): 413-425 (2009) - [j19]Heinz H. Bauschke
Bregman distances and Klee sets. J. Approx. Theory 158(2): 170-183 (2009) - [j18]Heinz H. Bauschke
Bregman distances and Chebyshev sets. J. Approx. Theory 159(1): 3-25 (2009) - [j17]Heinz H. Bauschke
A Note on the Paper by Eckstein and Svaiter on "General Projective Splitting Methods for Sums of Maximal Monotone Operators". SIAM J. Control. Optim. 48(4): 2513-2515 (2009) - 2008
- [j16]Heinz H. Bauschke
The Proximal Average: Basic Theory. SIAM J. Optim. 19(2): 766-785 (2008) - [j15]Heinz H. Bauschke
How to Transform One Convex Function Continuously into Another. SIAM Rev. 50(1): 115-132 (2008) - 2007
- [j14]Heinz H. Bauschke
Primal-Dual Symmetric Intrinsic Methods for Finding Antiderivatives of Cyclically Monotone Operators. SIAM J. Control. Optim. 46(6): 2031-2051 (2007) - [j13]Heinz H. Bauschke
Fitzpatrick Functions and Continuous Linear Monotone Operators. SIAM J. Optim. 18(3): 789-809 (2007) - 2006
- [j12]Heinz H. Bauschke
Symbolic computation of Fenchel conjugates. ACM Commun. Comput. Algebra 40(1): 18-28 (2006) - [j11]Heinz H. Bauschke
A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space. J. Approx. Theory 141(1): 63-69 (2006) - [j10]Heinz H. Bauschke
Extrapolation algorithm for affine-convex feasibility problems. Numer. Algorithms 41(3): 239-274 (2006) - [c4]Heinz H. Bauschke, Patrick L. Combettes
A Decomposition Method for Nonsmooth Convex Variational Signal Recovery. ICASSP (5) 2006: 989-992 - 2005
- [c3]Heinz H. Bauschke
A new generation of iterative transform algorithms for phase contrast tomography. ICASSP (4) 2005: 89-92 - 2004
- [j9]Heinz H. Bauschke
Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theory 127(2): 178-192 (2004) - 2003
- [j8]Heinz H. Bauschke
Duality for Bregman projections onto translated cones and affine subspaces. J. Approx. Theory 121(1): 1-12 (2003) - [j7]Heinz H. Bauschke
Bregman Monotone Optimization Algorithms. SIAM J. Control. Optim. 42(2): 596-636 (2003) - [j6]Heinz H. Bauschke
Iterating Bregman Retractions. SIAM J. Optim. 13(4): 1159-1173 (2003) - [j5]Heinz H. Bauschke
Recompression of JPEG images by requantization. IEEE Trans. Image Process. 12(7): 843-849 (2003) - 2002
- [c2]Heinz H. Bauschke
A requantization-based method for recompressing JPEG images. ICASSP 2002: 2489-2492 - [c1]Heinz H. Bauschke, Patrick L. Combettes
On the structure of some phase retrieval algorithms. ICIP (2) 2002: 841-844 - 2001
- [j4]Heinz H. Bauschke
A Weak-to-Strong Convergence Principle for Fejé-Monotone Methods in Hilbert Spaces. Math. Oper. Res. 26(2): 248-264 (2001)
1990 – 1999
- 1999
- [j3]Heinz H. Bauschke
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization. Math. Program. 86(1): 135-160 (1999) - [j2]Heinz H. Bauschke
An EM-Algorithm for Dynamic SPECT. IEEE Trans. Medical Imaging 18(3): 252-261 (1999) - 1996
- [j1]Heinz H. Bauschke
On Projection Algorithms for Solving Convex Feasibility Problems. SIAM Rev. 38(3): 367-426 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: