Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
From MaRDI portal
Publication:5211352
DOI10.1109/TAC.2019.2915745zbMATH Open1483.90119WikidataQ127896649 ScholiaQ127896649MaRDI QIDQ5211352FDOQ5211352
Authors: Kaihong Lu, Gangshan Jing, Long Wang 
Publication date: 28 January 2020
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Recommendations
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Online Distributed Convex Optimization on Dynamic Networks
- Distributed Online Optimization With Long-Term Constraints
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- Online Distributed Optimization With Nonconvex Objective Functions: Sublinearity of First-Order Optimality Condition-Based Regret
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed regularized online optimization using forward-backward splitting
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Adaptive online distributed optimization in dynamic environments
Online algorithms; streaming algorithms (68W27) Deterministic network models in operations research (90B10) Nonconvex programming, global optimization (90C26)
Cited In (9)
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- Gradient-free algorithms for distributed online convex optimization
- Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- Random gradient-free method for online distributed optimization with strongly pseudoconvex cost functions
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Online distributed optimization with stochastic gradients: high probability bound of regrets
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
This page was built for publication: Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211352)
