Login / Signup
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
Published in:
SIAM J. Optim. (2019)
Keyphrases
</>
linearly constrained
objective function
computational complexity
pairwise
variational inequalities
linear constraints
special case
convex optimization
cooperative
evolutionary algorithm
dynamic programming
probabilistic model
resource allocation
optimization method