An Adaptive Continuous-Time Algorithm for Nonsmooth Convex Resource Allocation Optimization
From MaRDI portal
Cited in
(9)- Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
- A p-power neurodynamic approach to distributed nonconvex optimization
- Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem
- Neuro-PINN: a hybrid framework for efficient nonlinear projection equation solutions
- Solving large-scale variational inequalities with dynamically adjusting initial condition in physics-informed neural networks
- A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem
- Distributed strategy for autonomous nonlinear multi-coalition games of high-order players over unconnected intra-coalition communications
- Time-varying distributed fuzzy resource allocation for multi-agent system over switching topology
- Zero gradient sum algorithm of arbitrary initial value with constraints and communication delay based on directed graph
This page was built for publication: An Adaptive Continuous-Time Algorithm for Nonsmooth Convex Resource Allocation Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077166)