Application of a Smoothing Technique to Decomposition in Convex Optimization
From MaRDI portal
Publication:4974416
DOI10.1109/TAC.2008.2007159zbMath1367.90085arXiv1302.3098OpenAlexW2106821132MaRDI QIDQ4974416
Johan A. K. Suykens, Ion Necoara
Publication date: 8 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3098
Related Items
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints ⋮ Interior-point Lagrangian decomposition method for separable convex optimization ⋮ Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization ⋮ Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks ⋮ Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems ⋮ Benchmarking large-scale distributed convex quadratic programming algorithms ⋮ Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs ⋮ A class of distributed optimization methods with event-triggered communication ⋮ Computational complexity certification for dual gradient method: application to embedded MPC ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization ⋮ On the computational efficiency of subgradient methods: a case study with Lagrangian bounds ⋮ Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming ⋮ An adaptive primal-dual framework for nonsmooth convex minimization ⋮ Distributed model predictive control -- recursive feasibility under inexact dual optimization ⋮ 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 ⋮ An extragradient-based alternating direction method for convex minimization ⋮ An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization ⋮ Solving nearly-separable quadratic optimization problems as nonsmooth equations ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC ⋮ An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization ⋮ Partially distributed outer approximation ⋮ Iteration complexity analysis of dual first-order methods for conic convex programming ⋮ Real-time model predictive control based on dual gradient projection: Theory and fixed-point FPGA implementation ⋮ Distributed coordination for nonsmooth convex optimization via saddle-point dynamics ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ Projection-free parallel quadratic programming for linear model predictive control ⋮ An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints ⋮ Primal recovery from consensus-based dual decomposition for distributed convex optimization
