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 constraintsInterior-point Lagrangian decomposition method for separable convex optimizationFast inertial dynamic algorithm with smoothing method for nonsmooth convex optimizationSmoothing Techniques-Based Distributed Model Predictive Control Algorithms for NetworksCombining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problemsBenchmarking large-scale distributed convex quadratic programming algorithmsRegularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphsA class of distributed optimization methods with event-triggered communicationComputational complexity certification for dual gradient method: application to embedded MPCAAR-based decomposition algorithm for non-linear convex optimisationA Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex MinimizationOn the computational efficiency of subgradient methods: a case study with Lagrangian boundsComplexity of first-order inexact Lagrangian and penalty methods for conic convex programmingAn adaptive primal-dual framework for nonsmooth convex minimizationDistributed model predictive control -- recursive feasibility under inexact dual optimizationAdaptive inexact fast augmented Lagrangian methods for constrained convex optimizationPath-following gradient-based decomposition algorithms for separable convex optimizationAdaptive smoothing algorithms for nonsmooth composite convex minimizationAn extragradient-based alternating direction method for convex minimizationAn adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimizationSolving nearly-separable quadratic optimization problems as nonsmooth equationsFast inexact decomposition algorithms for large-scale separable convex optimizationComplexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPCAn Augmented Lagrangian Based Algorithm for Distributed NonConvex OptimizationPartially distributed outer approximationIteration complexity analysis of dual first-order methods for conic convex programmingReal-time model predictive control based on dual gradient projection: Theory and fixed-point FPGA implementationDistributed coordination for nonsmooth convex optimization via saddle-point dynamicsAn exterior point polynomial-time algorithm for convex quadratic programmingA dual approach for optimal algorithms in distributed optimization over networksProjection-free parallel quadratic programming for linear model predictive controlAn inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraintsPrimal recovery from consensus-based dual decomposition for distributed convex optimization