Jefferson G. Melo

发表

An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians

Alfredo N. Iusem, Regina Sandra Burachik, Jefferson G. Melo, 2013, J. Optim. Theory Appl..

Strong Convergence in Hilbert Spaces via Γ-Duality

Jefferson G. Melo, Maicon Marques Alves, M. Alves, 2013, J. Optim. Theory Appl..

Duality and Exact Penalization for General Augmented Lagrangians

Alfredo N. Iusem, Jefferson G. Melo, Regina S. Burachik, 2010, J. Optim. Theory Appl..

A Partially Inexact Proximal Alternating Direction Method of Multipliers and Its Iteration-Complexity Analysis

Jefferson G. Melo, Vando A. Adona, Max L.N. Goncalves, 2018, J. Optim. Theory Appl..

A primal dual modified subgradient algorithm with sharp Lagrangian

Alfredo N. Iusem, Regina Sandra Burachik, Jefferson G. Melo, 2010, J. Glob. Optim..

Augmented Lagrangian methods for nonlinear programming with possible infeasibility

Jefferson G. Melo, L. F. Prudente, Max L. N. Gonçalves, 2015, J. Glob. Optim..

Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs

Weiwei Kong, Jefferson G. Melo, Renato D.C. Monteiro, 2018, SIAM J. Optim..

A Newton conditional gradient method for constrained nonlinear systems

Jefferson G. Melo, Max L. N. Gonçalves, M. Gonçalves, 2016, J. Comput. Appl. Math..

Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework

Renato D. C. Monteiro, Jefferson G. Melo, Max L. N. Gonçalves, 2016, SIAM J. Optim..

An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems

Weiwei Kong, Jefferson G. Melo, Renato D.C. Monteiro, 2018, Computational Optimization and Applications.

Subgradient Method for Convex Feasibility on Riemannian Manifolds

Jefferson G. Melo, Glaydston de Carvalho Bento, G. C. Bento, 2011, Journal of Optimization Theory and Applications.

Iteration-complexity analysis of a generalized alternating direction method of multipliers

Jefferson G. Melo, Max L. N. Gonçalves, Vando A. Adona, 2017, J. Glob. Optim..

An inexact proximal generalized alternating direction method of multipliers

Jefferson G. Melo, Vando A. Adona, Max L. N. Gonçalves, 2020, Comput. Optim. Appl..

Iteration-Complexity of Gradient, Subgradient and Proximal Point Methods on Riemannian Manifolds

Jefferson G. Melo, Glaydston de Carvalho Bento, G. C. Bento, 2016, Journal of Optimization Theory and Applications.

Pointwise and Ergodic Convergence Rates of a Variable Metric Proximal Alternating Direction Method of Multipliers

Jefferson G. Melo, Maicon Marques Alves, Max L. N. Gonçalves, 2018, J. Optim. Theory Appl..

A Strongly Convergent Proximal Point Method for Vector Optimization

Alfredo N. Iusem, Jefferson G. Melo, Ray G. Serra, 2021, Journal of Optimization Theory and Applications.

FISTA and Extensions -- Review and New Insights

Jefferson G. Melo, Renato D.C. Monteiro, Weiwei Kong, 2021, 2107.01267.

Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems

Jefferson G. Melo, R. Monteiro, M. Gonçalves, 2017, 1702.01850.

A Partially Inexact Alternating Direction Method of Multipliers and its Iteration-Complexity Analysis.

Jefferson G. Melo, Vando A. Adona, M. Gonçalves, 2018 .

On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM

Renato D. C. Monteiro, Jefferson G. Melo, Max L. N. Gonçalves, 2020, Optimization.

Extending the ergodic convergence rate of the proximal ADMM

Jefferson G. Melo, Max L.N. Goncalves, Renato D.C. Monteiro, 2016, 1611.02903.

Pointwise and ergodic convergence rates of a variable metric proximal ADMM

Jefferson G. Melo, Max L.N. Goncalves, M. Marques Alves, 2017, 1702.06626.

Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems

Jefferson G. Melo, R. Monteiro, Hairong Wang, 2020, 2006.08048.

Iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function and a full Lagrange multiplier update

Jefferson G. Melo, R. Monteiro, Weiwei Kong, 2020, 2008.00562.

Iteration-complexity of a Jacobi-type non-Euclidean ADMM for multi-block linearly constrained nonconvex programs

Jefferson G. Melo, R. Monteiro, J. Melo, 2017, 1705.07229.

Iteration-Complexity of a Linearized Proximal Multiblock ADMM Class for Linearly Constrained Nonconvex Optimization Problems

Jefferson G. Melo, R. Monteiro, J. Melo, 2017 .

Iteration-complexity of a proximal augmented Lagrangian method for solving nonconvex composite optimization problems with nonlinear convex constraints

Jefferson G. Melo, R. Monteiro, W. Kong, 2020, 2008.07080.

Iteration-complexity of an inner accelerated inexact proximal augmented Lagrangian method based on the classical Lagrangian function and a full Lagrange multiplier update

Jefferson G. Melo, R. Monteiro, Weiwei Kong, 2020 .

Projection-free accelerated method for convex optimization

Jefferson G. Melo, R. Monteiro, M. Gonçalves, 2020 .

The exact penalty map for nonsmooth and nonconvex optimization

Jefferson G. Melo, A. Iusem, R. Burachik, 2015 .

A proximal gradient splitting method for solving convex vector optimization problems

Jefferson G. Melo, Yunier Bello-Cruz, R. G. Serra, 2020, Optimization.

Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function

Jefferson G. Melo, R. Monteiro, Weiwei Kong, 2020, SIAM J. Optim..

Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints

Jefferson G. Melo, R. Monteiro, W. Kong, 2020, Math. Oper. Res..