Continuous-time distributed optimization with strictly pseudoconvex objective functions
From MaRDI portal
Publication:2071212
DOI10.1016/j.jfranklin.2021.11.034zbMath1481.93009OpenAlexW4200117719MaRDI QIDQ2071212
Publication date: 25 January 2022
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2021.11.034
Related Items (4)
Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique ⋮ Online distributed optimization with strongly pseudoconvex-sum cost functions and coupled inequality constraints ⋮ Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm ⋮ Event-triggered primal-dual design with linear convergence for distributed nonstrongly convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed constrained optimal consensus of multi-agent systems
- A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Optimal distributed stochastic mirror descent for strongly convex optimization
- Seven kinds of monotone maps
- Neural network for nonsmooth pseudoconvex optimization with general convex constraints
- Distributed constrained optimization for multi-agent systems over a directed graph with piecewise stepsize
- A neurodynamic approach to nonsmooth constrained pseudoconvex optimization problem
- Distributed heterogeneous multi-agent networks optimization with nonconvex velocity constraints
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics
- Continuous-Time Consensus Under Non-Instantaneous Reciprocity
- Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Distributed Subgradient Projection Algorithm Over Directed Graphs
- Distributed Algorithm for Solving Convex Inequalities
- Distributed Continuous-Time Nonsmooth Convex Optimization With Coupled Inequality Constraints
- Constrained Consensus and Optimization in Multi-Agent Networks
- Distributed Constrained Optimization Over Unbalanced Directed Networks Using Asynchronous Broadcast-Based Algorithm
- Distributed Dual Gradient Tracking for Resource Allocation in Unbalanced Networks
- Online Distributed Optimization With Strongly Pseudoconvex-Sum Cost Functions
- Continuous-Time Distributed Subgradient Algorithm for Convex Optimization With General Constraints
- Distributed continuous‐time algorithm for a general nonsmooth monotropic optimization problem
- Connectivity and Set Tracking of Multi-Agent Systems Guided by Multiple Moving Leaders
- A Multi-Agent System With a Proportional-Integral Protocol for Distributed Constrained Optimization
This page was built for publication: Continuous-time distributed optimization with strictly pseudoconvex objective functions
