Iteration-complexity of an inexact proximal accelerated augmented Lagrangian method for solving linearly constrained smooth nonconvex composite optimization problems
From MaRDI portal
Publication:6342893
arXiv2006.08048MaRDI QIDQ6342893
Renato D. C. Monteiro, Jefferson G. Melo, Hairong Wang
Publication date: 14 June 2020
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
49M27: Decomposition methods
47J22: Variational and other types of inclusions