default search action
Benar Fux Svaiter
Person information
- affiliation: National Institute for Pure and Applied Mathematics, Rio de Janeiro, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j57]Maicon Marques Alves, João M. Pereira, Benar Fux Svaiter:
A Search-Free \({O(1/{k}^{3/2})}\) Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities. SIAM J. Optim. 34(4): 3235-3258 (2024) - 2021
- [j56]Vincent Guigues
, Renato D. C. Monteiro, Benar Fux Svaiter
Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems. SIAM J. Optim. 31(3): 2084-2110 (2021) - 2020
- [i5]Romana Boiger, A. Leitao, Benar Fux Svaiter:
Range-relaxed criteria for choosing the Lagrange multipliers in nonstationary iterated Tikhonov method. CoRR abs/2011.05372 (2020) - [i4]A. Leitao, Benar Fux Svaiter:
On projective Landweber-Kaczmarz methods for solving systems of nonlinear ill-posed equations. CoRR abs/2011.05870 (2020) - [i3]A. Leitao, Fábio Margotti, Benar Fux Svaiter:
Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg-Marquardt method. CoRR abs/2011.05890 (2020) - [i2]A. Leitao, Benar Fux Svaiter:
On a family of gradient type projection methods for nonlinear ill-posed problems. CoRR abs/2011.06302 (2020)
2010 – 2019
- 2019
- [j55]Felipe Lara
A Further Study on Asymptotic Functions via Variational Analysis. J. Optim. Theory Appl. 182(1): 366-382 (2019) - [j54]Benar Fux Svaiter
A simplified proof of weak convergence in Douglas-Rachford method. Oper. Res. Lett. 47(4): 291-293 (2019) - 2018
- [j53]Benar Fux Svaiter
The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous. Oper. Res. Lett. 46(4): 430-433 (2018) - 2016
- [j52]Renato D. C. Monteiro, Camilo Ortiz, Benar Fux Svaiter
An adaptive accelerated first-order method for convex optimization. Comput. Optim. Appl. 64(1): 31-73 (2016) - [j51]Elizabeth W. Karas
Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method. Comput. Optim. Appl. 65(3): 723-751 (2016) - [j50]Maicon Marques Alves, Benar Fux Svaiter
A Variant of the Hybrid Proximal Extragradient Method for Solving Strongly Monotone Inclusions and its Complexity Analysis. J. Optim. Theory Appl. 168(1): 198-215 (2016) - [j49]Maicon Marques Alves, Benar Fux Svaiter
A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods. Math. Program. 155(1-2): 613-616 (2016) - [j48]Maicon Marques Alves, Renato D. C. Monteiro, Benar Fux Svaiter
Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds. SIAM J. Optim. 26(4): 2730-2743 (2016) - 2015
- [j47]Elizabeth W. Karas, Sandra A. Santos
Algebraic rules for quadratic regularization of Newton's method. Comput. Optim. Appl. 60(2): 343-376 (2015) - [j46]Renato D. C. Monteiro, Mauricio Romero Sicre
A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities. SIAM J. Optim. 25(4): 1965-1996 (2015) - [i1]Pedro Felipe Felzenszwalb, Benar Fux Svaiter:
Diffusion Methods for Classification with Pairwise Relationships. CoRR abs/1505.06072 (2015) - 2014
- [j45]Renato D. C. Monteiro, Camilo Ortiz, Benar Fux Svaiter
Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems. Comput. Optim. Appl. 57(1): 45-69 (2014) - [j44]Boushra Abbas, Hédy Attouch, Benar Fux Svaiter
Newton-Like Dynamics and Forward-Backward Methods for Structured Monotone Inclusions in Hilbert Spaces. J. Optim. Theory Appl. 161(2): 331-360 (2014) - [j43]Benar Fux Svaiter
A Class of Fejér Convergent Algorithms, Approximate Resolvents and the Hybrid Proximal-Extragradient Method. J. Optim. Theory Appl. 162(1): 133-153 (2014) - [j42]Renato D. C. Monteiro, Camilo Ortiz, Benar Fux Svaiter
A first-order block-decomposition method for solving two-easy-block structured semidefinite programs. Math. Program. Comput. 6(2): 103-150 (2014) - [j41]Roberto Andreani, José Mario Martínez
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist. Optim. Methods Softw. 29(3): 646-657 (2014) - 2013
- [j40]Hédy Attouch, Patrick Redont, Benar Fux Svaiter
Global Convergence of a Closed-Loop Regularized Newton Method for Solving Monotone Inclusions in Hilbert Spaces. J. Optim. Theory Appl. 157(3): 624-650 (2013) - [j39]Hédy Attouch, Jérôme Bolte, Benar Fux Svaiter
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods. Math. Program. 137(1-2): 91-129 (2013) - [j38]Orestes Bueno
A non-type (D) operator in c0. Math. Program. 139(1-2): 81-88 (2013) - [j37]Renato D. C. Monteiro, Benar Fux Svaiter
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers. SIAM J. Optim. 23(1): 475-507 (2013) - [j36]Renato D. C. Monteiro, Benar Fux Svaiter
An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods. SIAM J. Optim. 23(2): 1092-1125 (2013) - 2012
- [j35]Orizon Pereira Ferreira
A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance. J. Complex. 28(3): 346-363 (2012) - [j34]Renato D. C. Monteiro, Benar Fux Svaiter
Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems. SIAM J. Optim. 22(3): 914-935 (2012) - 2011
- [j33]R. D. Portugal, Benar Fux Svaiter
Weber-Fechner Law and the Optimality of the Logarithmic Scale. Minds Mach. 21(1): 73-81 (2011) - [j32]Benar Fux Svaiter
On Weak Convergence of the Douglas-Rachford Method. SIAM J. Control. Optim. 49(1): 280-287 (2011) - [j31]Hédy Attouch, Benar Fux Svaiter
A Continuous Dynamical Newton-Like Approach to Solving Monotone Inclusions. SIAM J. Control. Optim. 49(2): 574-598 (2011) - [j30]Renato D. C. Monteiro, Benar Fux Svaiter
Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems. SIAM J. Optim. 21(4): 1688-1720 (2011) - 2010
- [j29]Emerson V. Castelani, André L. M. Martinez
Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians. Comput. Optim. Appl. 46(2): 229-245 (2010) - [j28]Renato D. C. Monteiro, Benar Fux Svaiter
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean. SIAM J. Optim. 20(6): 2755-2787 (2010) - [j27]Roberto Andreani, José Mario Martínez, Benar Fux Svaiter
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences. SIAM J. Optim. 20(6): 3533-3554 (2010)
2000 – 2009
- 2009
- [j26]Orizon Pereira Ferreira
Kantorovich's majorants principle for Newton's method. Comput. Optim. Appl. 42(2): 213-229 (2009) - [j25]Fernanda M. P. Raupp, Benar Fux Svaiter
Analytic center of spherical shells and its application to analytic center machine. Comput. Optim. Appl. 43(3): 329-352 (2009) - [j24]Jonathan Eckstein
General Projective Splitting Methods for Sums of Maximal Monotone Operators. SIAM J. Control. Optim. 48(2): 787-811 (2009) - [j23]Jörg Fliege
Newton's Method for Multiobjective Optimization. SIAM J. Optim. 20(2): 602-626 (2009) - 2008
- [j22]R. D. Portugal, Marcelo G. Land
A computational model for telomere-dependent cell-replicative aging. Biosyst. 91(1): 262-267 (2008) - [j21]Jonathan Eckstein
A family of projective splitting methods for the sum of two maximal monotone operators. Math. Program. 111(1-2): 173-199 (2008) - [j20]L. Mauricio Graña Drummond, Nelson Maculan, Benar Fux Svaiter
On the choice of parameters for the weighting method in vector optimization. Math. Program. 111(1-2): 201-216 (2008) - [j19]L. Mauricio Graña Drummond, Nelson Maculan, Benar Fux Svaiter
On the choice of parameters for the weighting method in vector optimization. Math. Program. 112(1): 273 (2008) - 2005
- [j18]Regina Sandra Burachik
An Outer Approximation Method for the Variational Inequality Problem. SIAM J. Control. Optim. 43(6): 2071-2088 (2005) - [j17]Henri Bonnel, Alfredo N. Iusem, Benar Fux Svaiter
Proximal Methods in Vector Optimization. SIAM J. Optim. 15(4): 953-970 (2005) - 2004
- [j16]Carlos Humes Jr., Paulo J. S. Silva
Some Inexact Hybrid Proximal Augmented Lagrangian Algorithms. Numer. Algorithms 35(2-4): 175-184 (2004) - 2003
- [j15]Teemu Pennanen
Solving monotone inclusions with linear multi-step methods. Math. Program. 96(3): 469-487 (2003) - [j14]Alfredo N. Iusem, Teemu Pennanen, Benar Fux Svaiter
Inexact Variants of the Proximal Point Algorithm without Monotonicity. SIAM J. Optim. 13(4): 1080-1097 (2003) - 2002
- [j13]Marcos Raydan
Relaxed Steepest Descent and Cauchy-Barzilai-Borwein Method. Comput. Optim. Appl. 21(2): 155-167 (2002) - [j12]Orizon Pereira Ferreira
Kantorovich's Theorem on Newton's Method in Riemannian Manifolds. J. Complex. 18(1): 304-329 (2002) - [j11]Mikhail V. Solodov, Benar Fux Svaiter
A new proximal-based globalization strategy for the Josephy-Newton method for variational inequalities. Optim. Methods Softw. 17(5): 965-983 (2002) - 2001
- [j10]Regina Sandra Burachik
A Relative Error Tolerance for a Family of Generalized Proximal Point Methods. Math. Oper. Res. 26(4): 816-831 (2001) - [j9]O. Rolando Gárciga, Alfredo N. Iusem, Benar Fux Svaiter
On the need for hybrid steps in hybrid proximal point methods. Oper. Res. Lett. 29(5): 217-220 (2001) - 2000
- [j8]Jörg Fliege
Steepest descent methods for multicriteria optimization. Math. Methods Oper. Res. 51(3): 479-494 (2000) - [j7]Mikhail V. Solodov, Benar Fux Svaiter
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions. Math. Oper. Res. 25(2): 214-230 (2000) - [j6]Mikhail V. Solodov, Benar Fux Svaiter
Forcing strong convergence of proximal point iterations in a Hilbert space. Math. Program. 87(1): 189-202 (2000) - [j5]Mikhail V. Solodov, Benar Fux Svaiter
Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math. Program. 88(2): 371-389 (2000) - [j4]L. Mauricio Graña Drummond, Alfredo Noel Iusem, Benar Fux Svaiter:
On the central path for nonlinear semidefinite programming. RAIRO Oper. Res. 34(3): 331-345 (2000) - [j3]Mikhail V. Solodov, Benar Fux Svaiter
A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem. SIAM J. Optim. 10(2): 605-625 (2000)
1990 – 1999
- 1994
- [j2]Alfredo N. Iusem, Benar Fux Svaiter
Entropy-Like Proximal Methods in Convex Programming. Math. Oper. Res. 19(4): 790-814 (1994) - [j1]Alfredo N. Iusem, Benar Fux Svaiter
A row-action method for convex programming. Math. Program. 64: 149-171 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: