activity
20172021
most citedIteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems

12 citations · 22 across the 5 of their papers we have counts for

collaborators

7 papers

math.OC20211 cited

FISTA and Extensions -- Review and New Insights

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

The purpose of this technical report is to review the main properties of an accelerated composite gradient (ACG) method commonly referred to as the Fast Iterative Shrinkage-Thresho…

math.OC202012 cited

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

Jefferson G. Melo, Renato D. C. Monteiro, Hairong Wang

This paper proposes and establishes the iteration-complexity of an inexact proximal accelerated augmented Lagrangian (IPAAL) method for solving linearly constrained smooth nonconve…

math.OC2019

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

M. Marques Alves, Jonathan Eckstein, Marina Geremia +1

This paper derives new inexact variants of the Douglas-Rachford splitting method for maximal monotone operators and the alternating direction method of multipliers (ADMM) for conve…

math.OC2018

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

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

This paper proposes an efficient adaptive variant of a quadratic penalty accelerated inexact proximal point (QP-AIPP) method proposed earlier by the authors. Both the QP-AIPP metho…

math.OC2018

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

This paper analyzes the iteration-complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs. More sp…

math.OC20178 cited

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

Jefferson G. Melo, Renato D. C. Monteiro

This paper establishes the iteration-complexity of a Jacobi-type non-Euclidean proximal alternating direction method of multipliers (ADMM) for solving multi-block linearly constrai…