Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-19T23:13:49.914Z Has data issue: false hasContentIssue false
  • English
  • Français

APPLICATION OF PROJECTION ALGORITHMS TO DIFFERENTIAL EQUATIONS: BOUNDARY VALUE PROBLEMS

Part of: Boundary value problems Nonlinear operators and their properties

Published online by Cambridge University Press:  18 February 2019

BISHNU P. LAMICHHANE Open the ORCID record for BISHNU P. LAMICHHANE [Opens in a new window] ,
SCOTT B. LINDSTROM Open the ORCID record for SCOTT B. LINDSTROM [Opens in a new window]  and
BRAILEY SIMS Open the ORCID record for BRAILEY SIMS [Opens in a new window]
BISHNU P. LAMICHHANE
Affiliation:
Priority Research Centre for Computer-Assisted Research Mathematics and its Applications (CARMA), University of Newcastle, New South Wales, Australia email [email protected], [email protected], [email protected]
SCOTT B. LINDSTROM*
Affiliation:
Priority Research Centre for Computer-Assisted Research Mathematics and its Applications (CARMA), University of Newcastle, New South Wales, Australia email [email protected], [email protected], [email protected]
BRAILEY SIMS
Affiliation:
Priority Research Centre for Computer-Assisted Research Mathematics and its Applications (CARMA), University of Newcastle, New South Wales, Australia email [email protected], [email protected], [email protected]
*
✉[email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The Douglas–Rachford method has been employed successfully to solve many kinds of nonconvex feasibility problems. In particular, recent research has shown surprising stability for the method when it is applied to finding the intersections of hypersurfaces. Motivated by these discoveries, we reformulate a second order boundary value problem (BVP) as a feasibility problem where the sets are hypersurfaces. We show that such a problem may always be reformulated as a feasibility problem on no more than three sets and is well suited to parallelization. We explore the stability of the method by applying it to several BVPs, including cases where the traditional Newton’s method fails.

Keywords

boundary value problemDouglas–Rachford methodNewton’s methodhypersurface

MSC classification

Primary: 34B15: Nonlinear boundary value problems
Secondary: 47H10: Fixed-point theorems
Type
Research Article
Information
The ANZIAM Journal , Volume 61 , Issue 1 , January 2019 , pp. 23 - 46
Copyright
© 2019 Australian Mathematical Society 

References

Aragón Artacho, F. J. and Borwein, J. M., “Global convergence of a non-convex Douglas–Rachford iteration”, J. Global Optim. 57 (2013) 753–769; doi:10.1007/s10898-012-9958-4.Google Scholar
Aragón Artacho, F. J., Borwein, J. M. and Tam, M. K., “Recent results on Douglas–Rachford methods for combinatorial optimization problems”, J. Optim. Theory Appl. 163 (2014) 1–30; doi:10.1007/s10957-013-0488-0.Google Scholar
Aragón Artacho, F. J., Borwein, J. M. and Tam, M. K., “Douglas–Rachford feasibility methods for matrix completion problems”, ANZIAM J. 55 (2014) 299–326; doi:10.1017/S1446181114000145.Google Scholar
Aragón Artacho, F. J. and Campoy, R., “Solving graph coloring problems with the Douglas–Rachford algorithm”, Set-Valued Var. Anal. 26 (2018) 277–304; doi:10.1007/s11228-017-0461-4.Google Scholar
Bauschke, H. H. and Combettes, P. L., Convex analysis and monotone operator theory in Hilbert spaces, 2nd edn (Springer, Cham, 2017); doi:10.1007/978-3-319-48311-5.Google Scholar
Bauschke, H. H., Combettes, P. L. and Luke, D. R., “Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization”, J. Opt. Soc. Amer. A 19 (2002) 1334–1345; doi:10.1364/JOSAA.19.001334.Google Scholar
Benoist, J., “The Douglas–Rachford algorithm for the case of the sphere and the line”, J. Global Optim. 63 (2015) 363–380; doi:10.1007/s10898-015-0296-1.Google Scholar
Borwein, J. M., Lindstrom, S. B., Sims, B., Schneider, A. and Skerritt, M. P., “Dynamics of the Douglas–Rachford method for ellipses and $p$ -spheres”, Set-Valued Var. Anal. 26 (2018) 385–403; doi:10.1007/s11228-017-0457-0.Google Scholar
Borwein, J. M. and Sims, B., “The Douglas–Rachford algorithm in the absence of convexity”, in: Fixed-point algorithms for inverse problems in science and engineering, Volume 49 of Springer Optim. Appl. (Springer, New York, 2011) 93–109; doi:10.1007/978-1-4419-9569-8_6.Google Scholar
Borwein, J. M. and Tam, M. K., “Reflection methods for inverse problems with applications to protein conformation determination”, Springer volume on the CIMPA school Generalized Nash equilibrium problems, bilevel programming and MPEC, New Delhi, India, December 2012; doi:10.1007/978-981-10-4774-9_5.Google Scholar
Borwein, J. M. and Tam, M. K., “A cyclic Douglas–Rachford iteration scheme”, J. Optim. Theory Appl. 160 (2014) 1–29; doi:10.1007/s10957-013-0381-x.Google Scholar
Burden, R. L., Faires, D. J. and Burden, A. M., Numerical analysis (Cengage Learning, Boston, MA, 2016).Google Scholar
Dao, M. N. and Phan, H. M., “Linear convergence of projection algorithms”, Preprint, 2016,arXiv:1609.00341.Google Scholar
Dao, M. N. and Tam, M. K., “A Lyapunov-type approach to convergence of the Douglas–Rachford algorithm”, J. Global Optim. 73 (2019) 83–112; doi:10.1007/s10898-018-0677-3.Google Scholar
Douglas, J. and Rachford, H. H., “On the numerical solution of the heat conduction problem in 2 and 3 space variables”, Trans. Amer. Math. Soc. 82 (1956) 421–439; doi:10.2307/1993056.Google Scholar
Elser, V., Rankenburg, I. and Thibault, P., “Searching with iterated maps”, Proc. Natl. Acad. Sci. USA 104 (2007) 418–423; doi:10.1073/pnas.0606359104.Google Scholar
Gravel, S. and Elser, V., “Divide and concur: a general approach to constraint satisfaction”, Phys. Rev. E 78 (2008) 036706; doi:10.1103/PhysRevE.78.036706.Google Scholar
Keller, H. B., Numerical methods for two-point boundary value problems (Blaisdell, Waltham, MA, 1968).Google Scholar
Lewis, A. S., Luke, D. R. and Malick, J., “Local linear convergence for alternating and averaged nonconvex projections”, Found. Comput. Math. 9 (2009) 485–513; doi:10.1007/s10208-008-9036-y.Google Scholar
Lindstrom, S. B. and Sims, B., “Survey: sixty years of Douglas–Rachford”, Preprint, 2018,arXiv:1809.07181.Google Scholar
Lindstrom, S. B., Sims, B. and Skerritt, M. P., “Computing intersections of implicitly specified plane curves”, J. Nonlinear Convex Anal. 18 (2017) 347–359; http://www.ybook.co.jp/online2/opjnca/vol18/p347.html.Google Scholar
Lions, P. L. and Mercier, B., “Splitting algorithms for the sum of two nonlinear operators”, SIAM J. Numer. Anal. 16 (1979) 964–979; doi:10.1137/0716071.Google Scholar
Phan, H. M., “Linear convergence of the Douglas–Rachford method for two closed sets”, Optimization 65 (2016) 369–385; doi:10.1080/02331934.2015.1051532.Google Scholar
Pierra, G., “Decomposition through formalization in a product space”, Math. Program. 28 (1984) 96–115; https://link.springer.com/article/10.1007/BF02612715.Google Scholar
Roberts, A. W. and Varberg, D. E., Convex functions (Academic Press, New York, 1973).Google Scholar
Svaiter, B. F., “On weak convergence of the Douglas–Rachford method”, SIAM J. Control Optim. 49 (2011) 280–287; doi:10.1137/100788100.Google Scholar
Weisstein, E. W., “Heaviside step function”, Wolfram MathWorld, Wolfram Web Resources; http://mathworld.wolfram.com/HeavisideStepFunction.html.Google Scholar