Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-31T00:28:13.951Z Has data issue: false hasContentIssue false
  • English
  • Français

ITERATIVE PROJECTION AND REFLECTION METHODS: THEORY AND PRACTICE

Part of: Numerical methods in calculus of variations and optimal control

Published online by Cambridge University Press:  18 May 2016

MATTHEW K. TAM
MATTHEW K. TAM*
Affiliation:
Institut für Numerische und Angewandte Mathematik, Universität Göttingen, 37083 Göttingen, Germany email m.tam@math.uni-goettingen.de
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Keywords

feasibility problemprojection algorithmDouglas–Rachford algorithmprojection operatorreflection operator

MSC classification

Primary: 90C30: Nonlinear programming
Secondary: 49M37: Methods of nonlinear programming type

Information

Type
Abstracts of Australasian PhD Theses
Information
Bulletin of the Australian Mathematical Society , Volume 94 , Issue 1 , August 2016 , pp. 175 - 176
Copyright
© 2016 Australian Mathematical Publishing Association Inc. 

References

Aragón Artacho, F. J., Borwein, J. M. and Tam, M. K., ‘Douglas–Rachford feasibility methods for matrix completion problems’, ANZIAM J. 55(4) (2014), 299–326.Google Scholar
Borwein, J. M. and Tam, M. K., ‘A cyclic Douglas–Rachford iteration scheme’, J. Optim. Theory Appl. 160(1) (2014), 1–29.Google Scholar
Borwein, J. M. and Tam, M. K., ‘The cyclic Douglas–Rachford method for inconsistent feasibility problems’, J. Nonlinear Convex Anal. 16(4) (2015), 537–584.Google Scholar
Phan, H. M., ‘Linear convergence of the Douglas–Rachford method for two closed sets’, Optimization 65(2) (2016), 369–385.Google Scholar