Jefferson G. Melo

Orcid: 0000-0002-9659-5437

According to our database1, Jefferson G. Melo authored at least 22 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Proximal Augmented Lagrangian Method for Linearly Constrained Nonconvex Composite Optimization Problems.
J. Optim. Theory Appl., July, 2024

An away-step Frank-Wolfe algorithm for constrained multiobjective optimization.
Comput. Optim. Appl., July, 2024

2023
Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints.
Math. Oper. Res., May, 2023

Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function.
SIAM J. Optim., March, 2023

2022
Projection-free accelerated method for convex optimization.
Optim. Methods Softw., 2022

2021
A Strongly Convergent Proximal Point Method for Vector Optimization.
J. Optim. Theory Appl., 2021

2020
An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems.
Comput. Optim. Appl., 2020

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms.
Comput. Optim. Appl., 2020

An inexact proximal generalized alternating direction method of multipliers.
Comput. Optim. Appl., 2020

2019
Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs.
SIAM J. Optim., 2019

A Partially Inexact Proximal Alternating Direction Method of Multipliers and Its Iteration-Complexity Analysis.
J. Optim. Theory Appl., 2019

Iteration-complexity analysis of a generalized alternating direction method of multipliers.
J. Glob. Optim., 2019

2018
Pointwise and Ergodic Convergence Rates of a Variable Metric Proximal Alternating Direction Method of Multipliers.
J. Optim. Theory Appl., 2018

2017
Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework.
SIAM J. Optim., 2017

Iteration-Complexity of Gradient, Subgradient and Proximal Point Methods on Riemannian Manifolds.
J. Optim. Theory Appl., 2017

A Newton conditional gradient method for constrained nonlinear systems.
J. Comput. Appl. Math., 2017

2015
Augmented Lagrangian methods for nonlinear programming with possible infeasibility.
J. Glob. Optim., 2015

2013
An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians.
J. Optim. Theory Appl., 2013

Strong Convergence in Hilbert Spaces via Γ-Duality.
J. Optim. Theory Appl., 2013

2012
Subgradient Method for Convex Feasibility on Riemannian Manifolds.
J. Optim. Theory Appl., 2012

2010
Duality and Exact Penalization for General Augmented Lagrangians.
J. Optim. Theory Appl., 2010

A primal dual modified subgradient algorithm with sharp Lagrangian.
J. Glob. Optim., 2010


  Loading...