Zobrazeno 1 - 10
of 134
pro vyhledávání: '"Benar Fux Svaiter"'
Publikováno v:
SIAM Journal on Optimization. 31:2084-2110
In [V. Guigues, SIAM J. Optim., 30 (2020), pp. 407--438], an inexact variant of stochastic dual dynamic programming (SDDP) called ISDDP was introduced which uses approximate (instead of exact with ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8981fbae9c1a0c03b1f02ebbea4dde86
https://doi.org/10.1137/20m1330075
https://doi.org/10.1137/20m1330075
Publikováno v:
IMA Journal of Numerical Analysis. 41:2962-2989
In this article we propose a novel strategy for choosing the Lagrange multipliers in the Levenberg-Marquardt method for solving ill-posed problems modeled by nonlinear operators acting between Hilbert spaces. Convergence analysis results are establis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e47eace426e6c7dae1af6af10f40ece1
https://doi.org/10.1093/imanum/draa050
https://doi.org/10.1093/imanum/draa050
Publikováno v:
Optimization. 68:1521-1550
This paper studies the iteration-complexity of a new primal-dual algorithm based on Rockafellar's proximal method of multipliers (PMM) for solving smooth convex programming problems with in...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8a5f65a6eb7aed433504707b33156ad
https://doi.org/10.1080/02331934.2019.1597357
https://doi.org/10.1080/02331934.2019.1597357
Publikováno v:
Journal of Optimization Theory and Applications. 182:366-382
We use variational analysis for studying asymptotic (recession or horizon) functions. We introduce the upper and lower asymptotic operators and study their domain and image. Moreover, we characterize their fixed points and zeros. Finally, we establis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1cda238beeb0f94e6b521bf090633fe
https://doi.org/10.1007/s10957-019-01507-w
https://doi.org/10.1007/s10957-019-01507-w
Autor:
Benar Fux Svaiter, Antonio Leitão
In this article we combine the projective Landweber method, recently proposed by the authors, with Kaczmarz's method for solving systems of non-linear ill-posed equations. The underlying assumption used in this work is the tangential cone condition.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::58a2a3f95ea8629072c4b1ae914e2a93
http://arxiv.org/abs/2011.05870
http://arxiv.org/abs/2011.05870
In this article we propose a novel nonstationary iterated Tikhonov (NIT) type method for obtaining stable approximate solutions to ill-posed operator equations modeled by linear operators acting between Hilbert spaces. Geometrical properties of the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a94e328299cfb067110c61f856a8bec
http://arxiv.org/abs/2011.05372
http://arxiv.org/abs/2011.05372
Autor:
Benar Fux Svaiter, Antonio Leitão
Publikováno v:
Numerical Functional Analysis and Optimization. 39:1153-1180
We propose and analyze a family of successive projection methods whose step direction is the same as Landweber method for solving nonlinear ill-posed problems that satisfy the Tangential Cone Condition (TCC). This family enconpasses Landweber method,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03c05ab1e63f25cc91e8d11216f7179b
https://doi.org/10.1080/01630563.2018.1466331
https://doi.org/10.1080/01630563.2018.1466331
Autor:
Benar Fux Svaiter
Publikováno v:
Operations Research Letters. 46:430-433
The aim of this manuscript is to characterize the continuity properties of the multiobjective steepest descent direction (vector field) for smooth objective functions. We will show that this vector field is Holder continuous with optimal exponent 1/2
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d24d44067f8977855a389547e4b66f62
https://doi.org/10.1016/j.orl.2018.05.008
https://doi.org/10.1016/j.orl.2018.05.008
Autor:
Benar Fux Svaiter
Publikováno v:
Operations Research Letters. 47:291-293
Douglas–Rachford method is a splitting algorithm for finding a zero of the sum of two maximal monotone operators. Weak convergence in this method to a solution of the underlying monotone inclusion problem in the general case remained an open proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ae46598fe3f55ea2bfd530c61f7f602
https://doi.org/10.1016/j.orl.2019.04.007
https://doi.org/10.1016/j.orl.2019.04.007
Autor:
M. Marques Alves, Benar Fux Svaiter
Publikováno v:
Optimization. 67:67-82
We propose and study the iteration-complexity of a proximal-Newton method for finding approximate solutions of the problem of minimizing a twice continuously differentiable convex function on a (possibly infinite dimensional) Hilbert space. We prove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::13bc69931619c2463e1cd9f2ad8327a2
https://doi.org/10.1080/02331934.2017.1389942
https://doi.org/10.1080/02331934.2017.1389942