Roger Behling
Roger Behling
Fundação Getúlio Vargas
Verified email at - Homepage
Cited by
Cited by
A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods
R Behling, A Fischer
Optimization Letters 6 (5), 927-940, 2012
A Levenberg-Marquardt method with approximate projections
R Behling, A Fischer, M Herrich, A Iusem, Y Ye
Computational Optimization and Applications 59 (1-2), 5-26, 2014
The effect of calmness on the solution set of systems of nonlinear equations
R Behling, A Iusem
Mathematical Programming 137 (1), 155-165, 2013
Circumcentering the Douglas–Rachford method
R Behling, JYB Cruz, LR Santos
Numerical Algorithms 78 (3), 759-776, 2018
On the linear convergence of the circumcentered-reflection method
R Behling, JY Bello-Cruz, LR Santos
Operations Research Letters 46 (2), 159-162, 2018
On a conjecture in second-order optimality conditions
R Behling, G Haeser, A Ramos, DS Viana
Journal of Optimization Theory and Applications 176 (3), 625-633, 2018
The block-wise circumcentered–reflection method
R Behling, J Bello-Cruz, LR Santos
Computational Optimization and Applications 76 (3), 675-699, 2020
On second-order optimality conditions in nonlinear optimization
R Andreani, R Behling, G Haeser, PJS Silva
Optimization Methods and Software 32 (1), 22-38, 2017
On the constrained error bound condition and the projected Levenberg–Marquardt method
R Behling, A Fischer, G Haeser, A Ramos, K Schönefeld
Optimization 66 (8), 1397-1411, 2017
On the circumcentered-reflection method for the convex feasibility problem
R Behling, Y Bello-Cruz, LR Santos
Numerical Algorithms 86 (4), 1475-1494, 2021
Local convergence analysis of the Levenberg–Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition
R Behling, DS Gonçalves, SA Santos
Journal of Optimization Theory and Applications 183 (3), 1099-1122, 2019
The method and the trajectory of Levenberg-Marquardt
R Behling
PhD thesis, IMPA, Rio de Janeiro, Brazil, 2011
A special complementarity function revisited
R Behling, A Fischer, K Schönefeld, N Strasdat
Optimization 68 (1), 65-79, 2019
Primal-dual relationship between Levenberg–Marquardt and central trajectories for linearly constrained convex optimization
R Behling, C Gonzaga, G Haeser
Journal of Optimization Theory and Applications 162 (3), 705-717, 2014
The circumcentered-reflection method achieves better rates than alternating projections
R Arefidamghani, R Behling, Y Bello-Cruz, AN Iusem, LR Santos
Computational Optimization and Applications 79 (2), 507-530, 2021
Infeasibility and error bound imply finite convergence of alternating projections
R Behling, Y Bello-Cruz, LR Santos
arXiv preprint arXiv:2008.03354, 2020
Minimização de quadraticas convexas em caixas sobre variedades afins, um sub-problema de PQS
R Behling
Florianópolis, SC, 2006
Circumcentering approximate reflections for solving the convex feasibility problem
G Araújo, R Arefidamghani, R Behling, Y Bello-Cruz, A Iusem, LR Santos
arXiv preprint arXiv:2105.00497, 2021
Circumcentering projection type methods
R Behling
The system can't perform the operation now. Try again later.
Articles 1–19