Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
From MaRDI portal
Publication:354625
DOI10.1007/s10589-012-9515-6zbMath1295.90048arXiv1105.5427OpenAlexW2030224660MaRDI QIDQ354625
Carlo Savorgnan, Quoc Tran Dinh, Moritz Diehl
Publication date: 19 July 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1105.5427
Lagrangian decompositionsmoothing techniquelarge-scale problemdistributed optimizationseparable convex optimizationexcessive gapproximal mappings
Related Items (14)
A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm ⋮ A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints ⋮ An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem ⋮ Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement ⋮ Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization ⋮ Path-following gradient-based decomposition algorithms for separable convex optimization ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ Solving nearly-separable quadratic optimization problems as nonsmooth equations ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A primal-dual infeasible-interior-point algorithm for linear programming
- A proximal-based deomposition method for compositions method for convex minimization problems
- Introductory lectures on convex optimization. A basic course.
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Fast Multiple-Splitting Algorithms for Convex Optimization
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Applications of the method of partial inverses to convex programming: Decomposition
- A Parallel Algorithm for a Class of Convex Programs
- On the Implementation of a Primal-Dual Interior Point Method
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Distributed Spectrum Management Algorithms for Multiuser DSL Networks
- Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
- Excessive Gap Technique in Nonsmooth Convex Minimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Mean value cross decomposition for nonlinear convex problems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
