Pages that link to "Item:Q4974416"

The following pages link to Application of a Smoothing Technique to Decomposition in Convex Optimization (Q4974416):

Displaying 31 items.

• An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
• Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
• A class of distributed optimization methods with event-triggered communication (Q404510) (← links)
• Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
• Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
• An extragradient-based alternating direction method for convex minimization (Q525598) (← links)
• Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
• Computational complexity certification for dual gradient method: application to embedded MPC (Q894005) (← links)
• AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• Distributed model predictive control -- recursive feasibility under inexact dual optimization (Q1737767) (← links)
• Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
• Partially distributed outer approximation (Q2046262) (← links)
• Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization (Q2162532) (← links)
• Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
• An adaptive primal-dual framework for nonsmooth convex minimization (Q2220901) (← links)
• Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817) (← links)
• Distributed coordination for nonsmooth convex optimization via saddle-point dynamics (Q2327803) (← links)
• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
• Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC (Q2798546) (← links)
• An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization (Q2805706) (← links)
• Iteration complexity analysis of dual first-order methods for conic convex programming (Q2815553) (← links)
• Real-time model predictive control based on dual gradient projection: Theory and fixed-point FPGA implementation (Q2832687) (← links)
• Projection-free parallel quadratic programming for linear model predictive control (Q2868830) (← links)
• Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks (Q2926539) (← links)
• Benchmarking large-scale distributed convex quadratic programming algorithms (Q2943814) (← links)
• An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization (Q5745041) (← links)
• Coordinate descent methods beyond smoothness and separability (Q6498410) (← links)