Benar Fux Svaiter
Orcid: 0000-0003-3656-9883Affiliations:
- National Institute for Pure and Applied Mathematics, Rio de Janeiro, Brazil
According to our database1,
Benar Fux Svaiter
authored at least 61 papers
between 1994 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on d-nb.info
-
on w3.impa.br
On csauthors.net:
Bibliography
2024
A Search-Free \({O(1/{k}^{3/2})}\) Homotopy Inexact Proximal-Newton Extragradient Algorithm for Monotone Variational Inequalities.
SIAM J. Optim., 2024
2021
Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems.
SIAM J. Optim., 2021
2020
CoRR, 2020
Range-relaxed criteria for choosing the Lagrange multipliers in the Levenberg-Marquardt method.
CoRR, 2020
On projective Landweber-Kaczmarz methods for solving systems of nonlinear ill-posed equations.
CoRR, 2020
Range-relaxed criteria for choosing the Lagrange multipliers in nonstationary iterated Tikhonov method.
CoRR, 2020
2019
Oper. Res. Lett., 2019
J. Optim. Theory Appl., 2019
2018
The multiobjective steepest descent direction is not Lipschitz continuous, but is Hölder continuous.
Oper. Res. Lett., 2018
2016
Regularized HPE-Type Methods for Solving Monotone Inclusions with Improved Pointwise Iteration-Complexity Bounds.
SIAM J. Optim., 2016
A note on Fejér-monotone sequences in product spaces and its applications to the dual convergence of augmented Lagrangian methods.
Math. Program., 2016
A Variant of the Hybrid Proximal Extragradient Method for Solving Strongly Monotone Inclusions and its Complexity Analysis.
J. Optim. Theory Appl., 2016
Comput. Optim. Appl., 2016
Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method.
Comput. Optim. Appl., 2016
2015
A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities.
SIAM J. Optim., 2015
Comput. Optim. Appl., 2015
2014
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist.
Optim. Methods Softw., 2014
A first-order block-decomposition method for solving two-easy-block structured semidefinite programs.
Math. Program. Comput., 2014
A Class of Fejér Convergent Algorithms, Approximate Resolvents and the Hybrid Proximal-Extragradient Method.
J. Optim. Theory Appl., 2014
Newton-Like Dynamics and Forward-Backward Methods for Structured Monotone Inclusions in Hilbert Spaces.
J. Optim. Theory Appl., 2014
Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems.
Comput. Optim. Appl., 2014
2013
An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods.
SIAM J. Optim., 2013
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers.
SIAM J. Optim., 2013
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods.
Math. Program., 2013
Global Convergence of a Closed-Loop Regularized Newton Method for Solving Monotone Inclusions in Hilbert Spaces.
J. Optim. Theory Appl., 2013
2012
Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems.
SIAM J. Optim., 2012
A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance.
J. Complex., 2012
2011
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., 2011
SIAM J. Control. Optim., 2011
2010
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean.
SIAM J. Optim., 2010
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences.
SIAM J. Optim., 2010
Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians.
Comput. Optim. Appl., 2010
2009
SIAM J. Control. Optim., 2009
Comput. Optim. Appl., 2009
2008
A family of projective splitting methods for the sum of two maximal monotone operators.
Math. Program., 2008
Math. Program., 2008
2005
SIAM J. Control. Optim., 2005
2004
Numer. Algorithms, 2004
2003
SIAM J. Optim., 2003
2002
A new proximal-based globalization strategy for the Josephy-Newton method for variational inequalities.
Optim. Methods Softw., 2002
Comput. Optim. Appl., 2002
2001
Oper. Res. Lett., 2001
Math. Oper. Res., 2001
2000
A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem.
SIAM J. Optim., 2000
Error bounds for proximal point subproblems and associated inexact proximal point algorithms.
Math. Program., 2000
Math. Program., 2000
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions.
Math. Oper. Res., 2000
Math. Methods Oper. Res., 2000
1994