default search action
Hung M. Phan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Duy-Nhat Phan, Sedi Bartz, Nilabja Guha, Hung M. Phan:
Stochastic Variance-Reduced Majorization-Minimization Algorithms. SIAM J. Math. Data Sci. 6(4): 926-952 (2024) - 2023
- [i1]Duy-Nhat Phan, Sedi Bartz, Nilabja Guha, Hung M. Phan:
Stochastic Variance-Reduced Majorization-Minimization Algorithms. CoRR abs/2305.06848 (2023) - 2022
- [j17]Sedi Bartz, Minh N. Dao
, Hung M. Phan
Conical averagedness and convergence analysis of fixed point algorithms. J. Glob. Optim. 82(2): 351-373 (2022) - [j16]Sedi Bartz, Rubén Campoy
An Adaptive Alternating Direction Method of Multipliers. J. Optim. Theory Appl. 195(3): 1019-1055 (2022) - 2021
- [j15]Sedi Bartz
Multi-marginal maximal monotonicity and convex analysis. Math. Program. 185(1-2): 385-408 (2021) - [j14]Valentin R. Koch, Hung M. Phan
Optimization of triangular networks with spatial constraints. Optim. Methods Softw. 36(4): 842-868 (2021) - 2020
- [j13]Sedi Bartz, Rubén Campoy
Demiclosedness Principles for Generalized Nonexpansive Mappings. J. Optim. Theory Appl. 186(3): 759-778 (2020) - [j12]Minh N. Dao
Computing the resolvent of the sum of operators with application to best approximation problems. Optim. Lett. 14(5): 1193-1205 (2020)
2010 – 2019
- 2019
- [j11]Minh N. Dao
Linear Convergence of Projection Algorithms. Math. Oper. Res. 44(2): 715-738 (2019) - [j10]Minh N. Dao
Adaptive Douglas-Rachford Splitting Algorithm for the Sum of Two Operators. SIAM J. Optim. 29(4): 2697-2724 (2019) - 2018
- [j9]Minh N. Dao
Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems. J. Glob. Optim. 72(3): 443-474 (2018) - 2016
- [j8]Heinz H. Bauschke
Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization. Oper. Res. 64(1): 201-218 (2016) - [j7]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) - [j6]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) - 2014
- [j5]Heinz H. Bauschke
Restricted Normal Cones and Sparsity Optimization with Affine Constraints. Found. Comput. Math. 14(1): 63-83 (2014) - [j4]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) - 2012
- [j3]Boris S. Mordukhovich, Nguyen Mau Nam, Hung M. Phan
Variational Analysis of Marginal Functions with Applications to Bilevel Programming. J. Optim. Theory Appl. 152(3): 557-586 (2012) - [j2]Boris S. Mordukhovich, Hung M. Phan
Tangential extremal principles for finite and infinite systems of sets, I: basic theory. Math. Program. 136(1): 3-30 (2012) - [j1]Boris S. Mordukhovich, Hung M. Phan
Tangential extremal principles for finite and infinite systems of sets II: applications to semi-infinite and multiobjective optimization. Math. Program. 136(1): 31-63 (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-10-25 20:15 CEST 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: