Exact penalties for decomposable convex optimization problemsWe consider a general decomposable
convex optimization problem. By using right-hand side allocation
Decentralized multi-agent optimization based on a penalty methodWe propose a decentralized penalty method for general
convex constrained multi-agent
optimization Gradient methods with regularization for constrained optimization problems and their complexity estimates modifications of conditional gradient and gradient projection methods for smooth
convex optimization problems
Dual Decomposition Methods for Nonlinear Resource Allocation Problems in Telecommunication Networks convex optimization problem involving two kinds of constraints. By using the dual Lagrangian method
Gradient methods with regularization for constrained optimization problems and their complexity estimates modifications of conditional gradient and gradient projection methods for smooth
convex optimization problems
The method of multipliers for nonlinearly constrained variational inequalities and
convex differentiable constraints is considered. We prove the convergence of the method with an arbitrary