An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints

DOI10.1007/S10957-015-0757-1zbMATH Open1332.90199OpenAlexW242781686MaRDI QIDQ255080FDOQ255080

Authors: Jueyou Li, Changzhi Wu, Qiang Long, Xiangyu Wang, Zhiyou Wu 

Publication date: 9 March 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-015-0757-1

Recommendations

• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
• A fast dual gradient method for separable convex optimization via smoothing
• scientific article; zbMATH DE number 6453677
• Fast inexact decomposition algorithms for large-scale separable convex optimization
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization

zbMATH Keywords

convex optimizationdual decompositioninexact gradient methodsuboptimality and constraint violations

Mathematics Subject Classification ID

Convex programming (90C25) Parallel numerical computation (65Y05) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Smooth minimization of non-smooth functions
• Introductory lectures on convex optimization. A basic course.
• An accelerated inexact proximal point algorithm for convex minimization
• Gradient-free method for nonsmooth distributed optimization
• Accelerated and inexact forward-backward algorithms
• Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
• An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
• Smooth Optimization with Approximate Gradient
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• A parallel splitting method for separable convex programs
• Title not available (Why is that?)
• First-order methods of smooth convex optimization with inexact oracle
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
• An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
• Application of a Smoothing Technique to Decomposition in Convex Optimization
• Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
• Distributed proximal-gradient method for convex optimization with inequality constraints
• An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
• Approximation accuracy, gradient methods, and error bound for structured convex optimization

Cited In (13)

• A fast dual gradient method for separable convex optimization via smoothing
• Distributed algorithms for convex problems with linear coupling constraints
• Certification aspects of the fast gradient method for solving the dual of parametric convex programs
• On solving convex optimization problems with linear ascending constraints
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
• A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
• Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization
• Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems
• A fully distributed ADMM-based dispatch approach for virtual power plant problems
• Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks
• Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
• Convergence analysis of an inexact three-operator splitting algorithm
• Title not available (Why is that?)

This page was built for publication: An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255080)