Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
References
Index Terms
- Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
Recommendations
A subgradient proximal method for solving a class of monotone multivalued variational inequality problems
AbstractIt is well known that the algorithms with using a proximal operator can be not convergent for monotone variational inequality problems in the general case. Malitsky (Optim. Methods Softw. 33 (1) 140–164, ??) proposed a proximal extrapolated ...
Inexact proximal stochastic gradient method for convex composite optimization
We study an inexact proximal stochastic gradient (IPSG) method for convex composite optimization, whose objective function is a summation of an average of a large number of smooth convex functions and a convex, but possibly nonsmooth, function. Variance ...
Accelerated primal-dual methods with adaptive parameters for composite convex optimization with linear constraints
AbstractIn this paper, we introduce two accelerated primal-dual methods tailored to address linearly constrained composite convex optimization problems, where the objective function is expressed as the sum of a possibly nondifferentiable function and a ...
Highlights- We extend a class of Nesterov's accelerated scheme for solving unconstrained optimization problems to handle composite convex optimization with linear constraints.
- Propose an accelerated linearized augmented Lagrangian method (ALALM) ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Elsevier Science Inc.
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0