Accelerated Dual Descent for Network Flow Optimization
From MaRDI portal
Recommendations
- Dynamical Primal-Dual Nesterov Accelerated Method and Its Application to Network Optimization
- DUAL-BASED NEWTON METHODS FOR NONLINEAR MINIMUM COST NETWORK FLOW PROBLEMS
- scientific article; zbMATH DE number 60122
- Approximate subgradient methods for nonlinearly constrained network flow problems
- A unified framework for primal-dual methods in minimum cost network flow problems
- Dual coordinate step methods for linear network flow problems
- Asynchronous gradient algorithms for a class of convex separable network flow problems
- A primal-dual simplex algorithm for bi-objective network flow problems
Cited in
(11)- Distributed multi-step subgradient optimization for multi-agent system
- Parallel coordinate descent methods for big data optimization
- Distributed adaptive Newton methods with global superlinear convergence
- Distributed constrained optimization problem of heterogeneous linear multi-agent systems with communication delays
- A penalty-based method for communication-efficient decentralized bilevel programming
- Partition-based multi-agent optimization in the presence of lossy and asynchronous communication
- Distributed strategy for constrained resource allocation problems of autonomous second-order nonlinear agents and its application to smart grids
- Economic games as estimators
- Stochastic dual dynamical systems for linear equality constrained convex optimization problems
- Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function
- Practical prescribed-time distributed nonconvex optimization via a time-base generator
This page was built for publication: Accelerated Dual Descent for Network Flow Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983197)
