Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
From MaRDI portal
Publication:6136151
Recommendations
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Distributed convex optimization with coupling constraints over time-varying directed graphs
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- Distributed decision-coupled constrained optimization via proximal-tracking
Cites work
- A Saddle Point Algorithm for Networked Online Convex Optimization
- A one-layer recurrent neural network for constrained nonconvex optimization
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Constraint-Coupled Distributed Optimization: A Relaxation and Duality Approach
- Continuous-time distributed optimization with strictly pseudoconvex objective functions
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Convex Optimization on Time-Varying Directed Graphs
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed algorithm design for constrained resource allocation problems with high-order multi-agent systems
- Distributed decision-coupled constrained optimization via proximal-tracking
- Distributed ergodic algorithms for mixed equilibrium problems: absent of cut property
- Distributed online bandit optimization under random quantization
- Dual decomposition for multi-agent distributed optimization with coupling constraints
- Global optimal consensus for discrete-time multi-agent systems with bounded controls
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- On stabilizability of multi-agent systems
- Online Distributed Convex Optimization on Dynamic Networks
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Pseudomonotone variational inequalities: convergence of the auxiliary problem method
Cited in
(6)- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Distributed online optimization for heterogeneous linear multi-agent systems with coupled constraints
- Online distributed nonconvex optimization with stochastic objective functions: high probability bound analysis of dynamic regrets
- Decentralized online integer programming problems with a coupling cardinality constraint
This page was built for publication: Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136151)
