Fast inexact decomposition algorithms for large-scale separable convex optimization
From MaRDI portal
Abstract: In this paper we propose a new inexact dual decomposition algorithm for solving separable convex optimization problems. This algorithm is a combination of three techniques: dual Lagrangian decomposition, smoothing and excessive gap. The algorithm requires only one primal step and two dual steps at each iteration and allows one to solve the subproblem of each component inexactly and in parallel. Moreover, the algorithmic parameters are updated automatically without any tuning strategy as in augmented Lagrangian approaches. We analyze the convergence of the algorithm and estimate its worst-case complexity. Numerical examples are implemented to verify the theoretical results.
Recommendations
- scientific article; zbMATH DE number 6453677
- Fast multiple-splitting algorithms for convex optimization
- Inexact alternating direction methods of multipliers for separable convex optimization
- Complete decomposition algorithm for nonconvex separable optimization problems and applications
- An inexact hybrid splitting method for separable convex optimization
- Iterative bundle-based decomposition for large-scale nonseparable convex optimization
- A new technique for nonconvex primal-dual decomposition of a large-scale separable optimization problem
- An approximate decomposition algorithm for convex minimization
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- An algorithm for decomposition coordination of large scale convex programming problems
Cites work
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- A monotone+skew splitting model for composite monotone inclusions in duality
- A Parallel Algorithm for a Class of Convex Programs
- A proximal decomposition method for solving convex variational inverse problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction splittings for block angular parallel optimization
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Application of the alternating direction method of multipliers to separable convex programming problems
- Applications of the method of partial inverses to convex programming: Decomposition
- Benchmarking optimization software with performance profiles.
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Decomposition based interior point methods for two-stage stochastic convex quadratic programs with recourse
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Fast multiple-splitting algorithms for convex optimization
- scientific article; zbMATH DE number 3939102 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management
- Interior-point Lagrangian decomposition method for separable convex optimization
- Mean value cross decomposition for nonlinear convex problems
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition
- Smooth minimization of non-smooth functions
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
Cited in
(14)- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
- Path-following gradient-based decomposition algorithms for separable convex optimization
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- A fast dual gradient method for separable convex optimization via smoothing
- Fast multiple-splitting algorithms for convex optimization
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Exact penalties for decomposable convex optimization problems
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates
This page was built for publication: Fast inexact decomposition algorithms for large-scale separable convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790883)
