A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem

DOI10.1016/J.NEUNET.2024.106625MaRDI QIDQ6608896zbMATH OpenFDO

Authors Haoze Li, Linhua Luan, Sitian Qin

Publication date 20 September 2024

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.NEUNET.2024.106625

zbMATH Keywords

adaptive penaltymulti-agent systemneurodynamic approachsmoothing approximation

Mathematics Subject Classification ID

Multi-agent systems (93A16) Adaptive control/observation systems (93C40)

Recommendations

• An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games
• Distributed continuous-time proximal algorithm for nonsmooth resource allocation problem with coupled constraints
• Neurodynamic approaches for multi-agent distributed optimization
• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
• Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem

Cites work

• A class of smoothing functions for nonlinear and mixed complementarity problems
• A dynamical approach to convex minimization coupling approximation with the steepest descent method
• A neurodynamic optimization approach for complex-variables programming problem
• Adaptive Exact Penalty Design for Constrained Distributed Optimization
• An Adaptive Continuous-Time Algorithm for Nonsmooth Convex Resource Allocation Optimization
• An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games
• An event-triggered collaborative neurodynamic approach to distributed global optimization
• Convex analysis and global optimization
• Distributed constrained optimization for multi-agent networks with nonsmooth objective functions
• Distributed continuous-time algorithms for nonsmooth extended monotropic optimization problems
• Distributed Generator Coordination for Initialization and Anytime Optimization in Economic Dispatch
• Distributed optimal resource allocation over strongly connected digraphs: a surplus-based approach
• Distributed resource allocation via multi-agent systems under time-varying networks
• Distributed Smooth Convex Optimization With Coupled Constraints
• scientific article; zbMATH DE number 3855514 (Why is no real title available?)
• Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
• Neural network for nonsmooth pseudoconvex optimization with general convex constraints
• Neurodynamic approaches for multi-agent distributed optimization
• Optimization and nonsmooth analysis
• Smoothing methods for nonsmooth, nonconvex minimization

Cited in

(2)

• Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem
• Distributed proximal algorithms for constrained resource allocation over continuous and discrete communication

This page was built for publication: A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608896)