Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Scott B. Lindstrom"'
Autor:
Andrew Calcan, Scott B. Lindstrom
Publikováno v:
AIMS Mathematics, Vol 9, Iss 6, Pp 14640-14657 (2024)
Practitioners employ operator splitting methods—such as alternating direction method of multipliers (ADMM) and its "dual" Douglas-Rachford method (DR)—to solve many kinds of optimization problems. We provide a gentle introduction to these algorit
Externí odkaz:
https://doaj.org/article/731b65fe990e4b48879c5d0f384f1d65
Publikováno v:
Mathematical Programming. 200:229-278
We construct a general framework for deriving error bounds for conic feasibility problems. In particular, our approach allows one to work with cones that fail to be amenable or even to have computable projections, two previously challenging barriers.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a8f1939f164c93fe762be95a6d6f9ae
https://doi.org/10.1007/s10107-022-01883-8
https://doi.org/10.1007/s10107-022-01883-8
Autor:
Scott B. Lindstrom, Brailey Sims
Publikováno v:
Journal of the Australian Mathematical Society. 110:333-370
The Douglas–Rachford method is a splitting method frequently employed for finding zeros of sums of maximally monotone operators. When the operators in question are normal cone operators, the iterated process may be used to solve feasibility problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0d3662aaeaa4c44e51173b244b611d8
https://doi.org/10.1017/s1446788719000570
https://doi.org/10.1017/s1446788719000570
Publikováno v:
Trends in Mathematics ISBN: 9783030875015
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ff220413aacf629e33fc330e2447b85
https://doi.org/10.1007/978-3-030-87502-2_66
https://doi.org/10.1007/978-3-030-87502-2_66
Autor:
Paul Vrbik, Scott B. Lindstrom
Publikováno v:
The Mathematical Intelligencer. 41:1-9
Phase plotting is a useful way of visualising functions on complex space. We reinvent the method in the context of hyperbolic geometry, and we use it to plot functions on various representative surfaces for hyperbolic space, illustrating with direct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::659ed7c72602c20989143d023220cceb
https://doi.org/10.1007/s00283-019-09882-y
https://doi.org/10.1007/s00283-019-09882-y
Publikováno v:
Journal of Global Optimization. 74:79-93
The Douglas--Rachford algorithm is a popular algorithm for solving both convex and nonconvex feasibility problems. While its behaviour is settled in the convex inconsistent case, the general nonconvex inconsistent case is far from being fully underst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7abce881aae2a5ed1519d60d172e4f52
https://doi.org/10.1007/s10898-019-00744-7
https://doi.org/10.1007/s10898-019-00744-7
Publikováno v:
The ANZIAM Journal. 61:23-46
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 h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb1239e9b2218c66b8b0a7c3e178a153
https://doi.org/10.1017/s1446181118000391
https://doi.org/10.1017/s1446181118000391
Autor:
Scott B. Lindstrom
Publikováno v:
Handbook of the Mathematics of the Arts and Sciences ISBN: 9783319570716
Handbook of the Mathematics of the Arts and Sciences ISBN: 9783319706580
Handbook of the Mathematics of the Arts and Sciences
Handbook of the Mathematics of the Arts and Sciences ISBN: 9783319706580
Handbook of the Mathematics of the Arts and Sciences
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::deab1cf0b7dd0979cf8f4e74f13371a1
https://doi.org/10.1007/978-3-319-57072-3_133
https://doi.org/10.1007/978-3-319-57072-3_133
Every maximally monotone operator can be associated with a family of convex functions, called the Fitzpatrick family or family of representative functions. Surprisingly, in 2017, Burachik and Martínez-Legaz showed that the well-known Bregman distanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0cec995e762a353fa36aeeae2e5bf5a
Refereed/Peer-reviewed Recently, a new kind of distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9729d6e7ea306fea713ea70226f5567
https://hdl.handle.net/11541.2/26498
https://hdl.handle.net/11541.2/26498