![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
D. Russell Luke
Person information
- affiliation: University of Göttingen, Institute for Numerical and Applied Mathematics
- affiliation: University of Delaware, Department of Mathematical Sciences
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j27]Eyal Cohen, D. Russell Luke, Titus Pinta, Shoham Sabach, Marc Teboulle:
A semi-Bregman proximal alternating method for a class of nonconvex problems: local and global convergence analysis. J. Glob. Optim. 89(1): 33-55 (2024) - 2020
- [j26]D. Russell Luke
, Marc Teboulle, Nguyen H. Thao:
Necessary conditions for linear convergence of iterated expansive, set-valued mappings. Math. Program. 180(1): 1-31 (2020) - [j25]D. Russell Luke, Anna-Lena Martins:
Convergence Analysis of the Relaxed Douglas-Rachford Algorithm. SIAM J. Optim. 30(1): 542-584 (2020) - [j24]Nguyen Hieu Thao
, David Russell Luke, Oleg Soloviev
, Michel Verhaegen:
Phase Retrieval with Sparse Phase Constraint. SIAM J. Math. Data Sci. 2(1): 246-263 (2020)
2010 – 2019
- 2019
- [j23]D. Russell Luke, Shoham Sabach, Marc Teboulle
:
Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons. SIAM J. Math. Data Sci. 1(3): 408-445 (2019) - 2018
- [j22]Florian Lauster, D. Russell Luke, Matthew K. Tam:
Symbolic computation with monotone operators. ACM Commun. Comput. Algebra 52(4): 139-141 (2018) - [j21]D. Russell Luke
, Nguyen Hieu Thao
, Matthew K. Tam:
Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings. Math. Oper. Res. 43(4): 1143-1176 (2018) - [j20]Alexander Y. Kruger
, D. Russell Luke
, Nguyen Hieu Thao
:
Set regularities and feasibility problems. Math. Program. 168(1-2): 279-311 (2018) - 2017
- [j19]D. Russell Luke, Shoham Sabach, Marc Teboulle, Kobi Zatlawey:
A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem. J. Glob. Optim. 69(4): 889-909 (2017) - [j18]C. Charitha, Joydeep Dutta, D. Russell Luke:
Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities. Math. Program. 161(1-2): 519-549 (2017) - 2016
- [j17]Timo Aspelmeier, C. Charitha, D. Russell Luke:
Local Linear Convergence of the ADMM/Douglas-Rachford Algorithms without Strong Convexity and Application to Statistical Imaging. SIAM J. Imaging Sci. 9(2): 842-868 (2016) - 2015
- [j16]Robert Hesse, D. Russell Luke, Shoham Sabach, Matthew K. Tam
:
Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging. SIAM J. Imaging Sci. 8(1): 426-457 (2015) - [c4]Jingwei Liang, Jalal Fadili, Gabriel Peyré, D. Russell Luke:
Activity Identification and Local Linear Convergence of Douglas-Rachford/ADMM under Partial Smoothness. SSVM 2015: 642-653 - [r1]Jonathan M. Borwein, D. Russell Luke:
Duality and Convex Programming. Handbook of Mathematical Methods in Imaging 2015: 257-304 - 2014
- [j15]Heinz H. Bauschke
, D. Russell Luke, Hung M. Phan
, Xianfu Wang:
Restricted Normal Cones and Sparsity Optimization with Affine Constraints. Found. Comput. Math. 14(1): 63-83 (2014) - [j14]Robert Hesse, D. Russell Luke, Patrick Neumann:
Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility. IEEE Trans. Signal Process. 62(18): 4868-4881 (2014) - 2013
- [j13]D. Russell Luke:
Prox-Regularity of Rank Constraint Sets and Implications for Algorithms. J. Math. Imaging Vis. 47(3): 231-238 (2013) - [j12]Robert Hesse, D. Russell Luke:
Nonconvex Notions of Regularity and Convergence of Fundamental Algorithms for Feasibility Problems. SIAM J. Optim. 23(4): 2397-2419 (2013) - 2011
- [p1]Jonathan M. Borwein, D. Russell Luke:
Entropic Regularization of the ℓ 0 Function. Fixed-Point Algorithms for Inverse Problems in Science and Engineering 2011: 65-92 - [e1]Heinz H. Bauschke, Regina Sandra Burachik
, Patrick L. Combettes
, Veit Elser, D. Russell Luke, Henry Wolkowicz:
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]
2000 – 2009
- 2009
- [j11]Adrian S. Lewis, D. Russell Luke, Jérôme Malick:
Local Linear Convergence for Alternating and Averaged Nonconvex Projections. Found. Comput. Math. 9(4): 485-513 (2009) - [j10]Tilo Arens, Armin Lechleiter
, D. Russell Luke:
MUSIC for Extended Scatterers as an Instance of the Factorization Method. SIAM J. Appl. Math. 70(4): 1283-1304 (2009) - 2008
- [j9]D. Russell Luke:
Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space. SIAM J. Optim. 19(2): 714-739 (2008) - 2007
- [j8]D. Russell Luke, Anthony J. Devaney:
Identifying Scattering Obstacles by the Construction of Nonscattering Waves. SIAM J. Appl. Math. 68(1): 271-291 (2007) - 2006
- [j7]Heinz H. Bauschke
, Patrick L. Combettes
, D. Russell Luke:
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) - 2005
- [j6]D. Russell Luke:
Image Synthesis for Inverse Obstacle Scattering Using the Eigenfunction Expansion Theorem. Computing 75(2-3): 181-196 (2005) - [c3]Heinz H. Bauschke
, Patrick L. Combettes
, D. Russell Luke:
A new generation of iterative transform algorithms for phase contrast tomography. ICASSP (4) 2005: 89-92 - 2004
- [j5]Heinz H. Bauschke
, Patrick L. Combettes
, D. Russell Luke:
Finding best approximation pairs relative to two closed convex sets in Hilbert spaces. J. Approx. Theory 127(2): 178-192 (2004) - [j4]D. Russell Luke:
Multifrequency inverse obstacle scattering: the point source method and generalized filtered backprojection. Math. Comput. Simul. 66(4-5): 297-314 (2004) - 2003
- [j3]D. Russell Luke, Roland Potthast
:
The No Response Test---A Sampling Method for Inverse Scattering Problems. SIAM J. Appl. Math. 63(4): 1292-1312 (2003) - [j2]James V. Burke, D. Russell Luke:
Variational Analysis Applied to the Problem of Optical Phase Retrieval. SIAM J. Control. Optim. 42(2): 576-595 (2003) - 2002
- [j1]D. Russell Luke, James V. Burke, Richard G. Lyon:
Optical Wavefront Reconstruction: Theory and Numerical Methods. SIAM Rev. 44(2): 169-224 (2002) - [c2]D. Russell Luke, Roland Potthast:
The point source method in acoustic scattering: Numerical reconstruction of the scattered field from far field measurements of inhomogeneous media. ICASSP 2002: 3541-3544 - [c1]Heinz H. Bauschke, Patrick L. Combettes
, D. Russell Luke:
On the structure of some phase retrieval algorithms. ICIP (2) 2002: 841-844
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-05-03 20:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint