Hung M. Phan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hung M. Phan has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Heinz H. Bauschke
Mathematics, University of British Columbia, Kelowna, B.C. V1V 1V7, Canada
4 shared publications - Xianfu Wang
Department of Mathematics, I.K. Barber Faculty of Science, University of British Columbia Okanagan, Kelowna, Canada
4 shared publications - D. Russell Luke
Institut für Numerische und Angewandte Mathematik, Universität Göttingen, Göttingen, Germany
2 shared publications
Latest Publications
- 31 December 2013
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 42 (4) , 421-450
The Method of Alternating Relaxed Projections for Two Nonconvex Sets
- 31 December 2013
- Published by Springer Nature in Vietnam Journal of Mathematics
- Vol. 42 (4) , 421-450
The Method of Alternating Relaxed Projections for Two Nonconvex Sets
- Open Access
The Method of Alternating Relaxed Projections for two nonconvex sets
The Method of Alternating Projections (MAP), a classical algorithm for solving feasibility prob- lems, has recently been intensely studied for nonconvex sets. However, intrinsically available are only local convergence results: convergence occurs if the starting point is not too far away from solutions to avoid getting trapped in certain regions. Instead of taking full projection steps, it can be advantageous to underrelax, i.e., to move only part way towards the constraint set, in order to enlarge the regions of convergence. In this paper, we thus systematically study the Method of Alternating Relaxed Projections (MARP) for two (possibly nonconvex) sets. Complementing our recent work on MAP, we es- tablish local linear convergence results for the MARP. Several examples illustrate our analysis.
Open AccessThe Method of Alternating Relaxed Projections for two nonconvex sets
The Method of Alternating Projections (MAP), a classical algorithm for solving feasibility prob- lems, has recently been intensely studied for nonconvex sets. However, intrinsically available are only local convergence results: convergence occurs if the starting point is not too far away from solutions to avoid getting trapped in certain regions. Instead of taking full projection steps, it can be advantageous to underrelax, i.e., to move only part way towards the constraint set, in order to enlarge the regions of convergence. In this paper, we thus systematically study the Method of Alternating Relaxed Projections (MARP) for two (possibly nonconvex) sets. Complementing our recent work on MAP, we es- tablish local linear convergence results for the MARP. Several examples illustrate our analysis.
- 16 May 2013
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 21 (3) , 431-473
Restricted Normal Cones and the Method of Alternating Projections: Theory
- 16 May 2013
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 21 (3) , 431-473
Restricted Normal Cones and the Method of Alternating Projections: Theory
- 16 May 2013
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 21 (3) , 475-501
Restricted Normal Cones and the Method of Alternating Projections: Applications
- 16 May 2013
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 21 (3) , 475-501
Restricted Normal Cones and the Method of Alternating Projections: Applications