A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
From MaRDI portal
(Redirected from Publication:301677)
Recommendations
- 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 inexact decomposition algorithms for large-scale separable convex optimization
- A fast dual proximal gradient algorithm for convex minimization and applications
- A splitting method for separable convex programming
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- A first-order smoothed penalty method for compressed sensing
- A proximal-based deomposition method for compositions method for convex minimization problems
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction method with Gaussian back substitution for separable convex programming
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Application of a Smoothing Technique to Decomposition in Convex Optimization
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Double smoothing technique for large-scale linearly constrained convex optimization
- Fast multiple-splitting algorithms for convex optimization
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Gradient-free method for nonsmooth distributed optimization
- Interior-point Lagrangian decomposition method for separable convex optimization
- Introductory lectures on convex optimization. A basic course.
- Mirror Prox algorithm for multi-term composite minimization and semi-separable problems
- NESTA: A fast and accurate first-order method for sparse recovery
- On augmented Lagrangian decomposition methods for multistage stochastic programs
- On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
- Smooth minimization of non-smooth functions
- Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
Cited in
(14)- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- A fully distributed ADMM-based dispatch approach for virtual power plant problems
- Sparsity-promoting distributed charging control for plug-in electric vehicles over distribution networks
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Proximal primal-dual best approximation algorithm with memory
- Double smoothing technique for large-scale linearly constrained convex optimization
- Inexact alternating direction methods of multipliers for separable convex optimization
- Incremental gradient-free method for nonsmooth distributed optimization
- scientific article; zbMATH DE number 1424520 (Why is no real title available?)
- A fast dual gradient method for separable convex optimization via smoothing
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
This page was built for publication: A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301677)
