Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Roger Behling"'
Publikováno v:
Optimization Letters. 17:1069-1081
Generalized circumcenters have been recently introduced and employed to speed up classical projection-type methods for solving feasibility problems. In this note, circumcenters are enforced in a new setting; they are proven to provide inward directio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad2f60e9d9d76978c46483e6e2bd19fa
https://doi.org/10.1007/s11590-022-01923-4
https://doi.org/10.1007/s11590-022-01923-4
Publikováno v:
Numerical Algorithms. 86:1475-1494
The ancient concept of circumcenter has recently given birth to the Circumcentered-Reflection method (CRM). CRM was first employed to solve best approximation problems involving affine subspaces. In this setting, it was shown to outperform the most p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01a430fdc09ad0217b93b5d8f9c1ebbc
https://doi.org/10.1007/s11075-020-00941-6
https://doi.org/10.1007/s11075-020-00941-6
Publikováno v:
Journal of Optimization Theory and Applications. 183:1099-1122
The Levenberg–Marquardt method is widely used for solving nonlinear systems of equations, as well as nonlinear least-squares problems. In this paper, we consider local convergence properties of the method, when applied to nonzero-residue nonlinear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2843ae86c9232cd2bdfde2ebc2ea6c96
https://doi.org/10.1007/s10957-019-01586-9
https://doi.org/10.1007/s10957-019-01586-9
This paper is devoted to deriving the first circumcenter iteration scheme that does not employ a product space reformulation for finding a point in the intersection of two closed convex sets. We introduce a so-called centralized version of the circum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d84c4f76eed23c1b2e78728061dfba4b
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names such as Ka
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ed46c6262f2ec9c1791ae26be7eeba8
http://arxiv.org/abs/2008.03354
http://arxiv.org/abs/2008.03354
Publikováno v:
Optimization. 68:65-79
Recently, a local framework of Newton-type methods for constrained systems of equations has been developed. Applied to the solution of Karush–Kuhn–Tucker (KKT) systems, the framework enables local ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5973e043e0730fa33c96e02a24ff974
https://doi.org/10.1080/02331934.2018.1470177
https://doi.org/10.1080/02331934.2018.1470177
Publikováno v:
Numerical Algorithms. 78:759-776
We introduce and study a geometric modification of the Douglas-Rach\-ford method called the Circumcentered-Douglas-Rachford method. This method iterates by taking the intersection of bisectors of reflection steps for solving certain classes of feasib
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc43b742f8f4b8bf669f90c3e26d4685
https://doi.org/10.1007/s11075-017-0399-5
https://doi.org/10.1007/s11075-017-0399-5
We study the convergence rate of the Circumcentered-Reflection Method (CRM) for solving the convex feasibility problem and compare it with the Method of Alternating Projections (MAP). Under an error bound assumption, we prove that both methods conver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::57a82d701e6b2927712fd288c30fed26
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
In this paper, we first derive a characterization of the solution set of a continuously differentiable system of equations subject to a closed feasible set. Assuming that a constrained local error bound condition is satisfied, we prove that the solut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c0f088b6029f0c8927b085b135229aa
https://doi.org/10.1080/02331934.2016.1200578
https://doi.org/10.1080/02331934.2016.1200578
The elementary Euclidean concept of circumcenter has recently been employed to improve two aspects of the classical Douglas--Rachford method for projecting onto the intersection of affine subspaces. The so-called circumcentered-reflection method is a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17ee2b68012d859f203df3153ba6fe40