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

DOI10.1007/S10957-015-0757-1zbMath1332.90199OpenAlexW242781686MaRDI QIDQ255080

Changzhi Wu, Qiang Long, Xiangyu Wang, Jueyou Li, Zhi-You 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

zbMATH Keywords

convex optimizationdual decompositioninexact gradient methodsuboptimality and constraint violations

Mathematics Subject Classification ID

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

Related Items (7)

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 ⋮ Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks ⋮ Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization ⋮ Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks ⋮ A fully distributed ADMM-based dispatch approach for virtual power plant problems ⋮ Convergence analysis of an inexact three-operator splitting algorithm

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• A parallel splitting method for separable convex programs
• First-order methods of smooth convex optimization with inexact oracle
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
• Approximation accuracy, gradient methods, and error bound for structured convex optimization
• 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
• Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
• 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

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