Distributed proximal-gradient method for convex optimization with inequality constraints
From MaRDI portal
Recommendations
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new exact penalty function method for continuous inequality constrained optimization problems
- A penalty function algorithm with objective parameters for nonlinear mathematical programming
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning
- Constrained Consensus and Optimization in Multi-Agent Networks
- Distributed average consensus with least-mean-square deviation
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Fast linear iterations for distributed averaging
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Min-max optimal control of linear systems with uncertainty and terminal state constraints
- Minimizing control variation in nonlinear optimal control
- Necessary and sufficient conditions for a penalty method to be exact
- On an exact penalty function method for semi-infinite programming problems
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- Subgradient methods for saddle-point problems
Cited in
(17)- Stochastic mirror descent method for distributed multi-agent optimization
- Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
- Incremental gradient-free method for nonsmooth distributed optimization
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems
- Proximal nested primal-dual gradient algorithms for distributed constraint-coupled composite optimization
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
- Inexact dual averaging method for distributed multi-agent optimization
- Distributed Algorithm for Solving Convex Inequalities
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
- Distributed Design for Nuclear Norm Minimization of Linear Matrix Equations With Constraints
- A fixed step distributed proximal gradient push‐pull algorithm based on integral quadratic constraint
- A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
- A subgradient-based continuous-time algorithm for constrained distributed quadratic programming
This page was built for publication: Distributed proximal-gradient method for convex optimization with inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174338)
