default search action
Walaa M. Moursi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Regina Sandra Burachik
, C. Yalçin Kaya
Infeasible and Critically Feasible Optimal Control. J. Optim. Theory Appl. 203(2): 1219-1245 (2024) - [j22]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) - [j21]Heinz H. Bauschke
On the Douglas-Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems. Math. Oper. Res. 49(1): 58-77 (2024) - [j20]Regina Sandra Burachik
Optimal Control Duality and the Douglas-Rachford Algorithm. SIAM J. Control. Optim. 62(1): 680-698 (2024) - 2023
- [j19]Leon Liu, Walaa M. Moursi, Jon Vanderwerff:
Strongly Nonexpansive Mappings Revisited: Uniform Monotonicity and Operator Splitting. SIAM J. Optim. 33(4): 2570-2597 (2023) - 2021
- [j18]Heinz H. Bauschke
Generalized monotone operators and their averaged resolvents. Math. Program. 189(1): 55-74 (2021) - [j17]Heinz H. Bauschke, Sylvain Gretchko, Walaa M. Moursi, Matthew Saurette:
Edelstein's Astonishing Affine Isometry. Am. Math. Mon. 128(9): 796-809 (2021) - 2020
- [j16]Heinz H. Bauschke
On the Minimal Displacement Vector of Compositions and Convex Combinations of Nonexpansive Mappings. Found. Comput. Math. 20(6): 1653-1666 (2020) - [j15]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)
2010 – 2019
- 2019
- [j14]Enzo Busseti
Solution refinement at regular points of conic problems. Comput. Optim. Appl. 74(3): 627-643 (2019) - [j13]Walaa M. Moursi
Douglas-Rachford Splitting for the Sum of a Lipschitz Continuous and a Strongly Monotone Operator. J. Optim. Theory Appl. 183(1): 179-198 (2019) - 2018
- [j12]Walaa M. Moursi
The Forward-Backward Algorithm and the Normal Problem. J. Optim. Theory Appl. 176(3): 605-624 (2018) - [j11]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) - [j10]Salihah Alwadani, Heinz H. Bauschke
On the asymptotic behaviour of the Aragón Artacho-Campoy algorithm. Oper. Res. Lett. 46(6): 585-587 (2018) - 2017
- [j9]Heinz H. Bauschke
On the Douglas-Rachford algorithm. Math. Program. 164(1-2): 263-284 (2017) - 2016
- [j8]Heinz H. Bauschke
On the Range of the Douglas-Rachford Operator. Math. Oper. Res. 41(3): 884-897 (2016) - [j7]Sarah M. Moffat, Walaa M. Moursi
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions. Math. Program. 160(1-2): 193-223 (2016) - [j6]Heinz H. Bauschke
On the order of the operators in the Douglas-Rachford algorithm. Optim. Lett. 10(3): 447-455 (2016) - [j5]Heinz H. Bauschke
The Douglas-Rachford algorithm in the affine-convex case. Oper. Res. Lett. 44(3): 379-382 (2016) - [j4]Heinz H. Bauschke
The Douglas-Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces. SIAM J. Optim. 26(2): 968-985 (2016) - 2015
- [j3]Heinz H. Bauschke
A derivative-free comirror algorithm for convex optimization. Optim. Methods Softw. 30(4): 706-726 (2015) - 2014
- [j2]Heinz H. Bauschke
Generalized Solutions for the Sum of Two Maximally Monotone Operators. SIAM J. Control. Optim. 52(2): 1034-1047 (2014) - 2012
- [j1]Heinz H. Bauschke
Attouch-Théra duality revisited: Paramonotonicity and operator splitting. J. Approx. Theory 164(8): 1065-1084 (2012)
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-12-10 20:45 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: