Adaptive penalty-based neurodynamic approach for nonsmooth interval-valued optimization problem.

The complex and diverse practical background drives this paper to explore a new neurodynamic approach (NA) to solve nonsmooth interval-valued optimization problems (IVOPs) constrained by interval partial order and more general sets. On the one hand, to deal with the uncertainty of interval-valued information, the LU-optimality condition of IVOPs is established through a deterministic form. On the other hand, according to the penalty method and adaptive controller, the interval partial order constraint and set constraint are punished by one adaptive parameter, which is a key enabler for the feasibility of states while having a lower solution space dimension and avoiding estimating exact penalty parameters. Through nonsmooth analysis and Lyapunov theory, the proposed adaptive penalty-based neurodynamic approach (APNA) is proven to converge to an LU-solution of the considered IVOPs. Finally, the feasibility of the proposed APNA is illustrated by numerical simulations and an investment decision-making problem.

Adaptive Neurodynamic Approach to Multiple Constrained Distributed Resource Allocation.

In this article, an adaptive neurodynamic approach over multiagent systems is designed to solve nonsmooth distributed resource allocation problems (DRAPs) with affine-coupled equality constraints, coupled inequality constraints, and private set constraints. It is to say, agents focus on tracking the optimal allocation to minimize the team cost under more general constraints. Among the considered constraints, multiple coupled constraints are dealt with by introducing auxiliary variables to make Lagrange multipliers reach consensus. Furthermore, aiming to address private set constraints, an adaptive controller is proposed with the aid of the penalty method, thus avoiding the disclosure of global information. Through using the Lyapunov stability theory, the convergence of this neurodynamic approach is analyzed. In addition, to reduce the communication burden of systems, the proposed neurodynamic approach is improved by introducing an event-triggered mechanism. In this case, the convergence property is also explored, and the Zeno phenomenon is excluded. Finally, a numerical example and a simplified problem on a virtual 5G system are implemented to demonstrate the effectiveness of the proposed neurodynamic approaches.

A continuous-time neurodynamic approach and its discretization for distributed convex optimization over multi-agent systems.

Distributed optimization problem (DOP) over multi-agent systems, which can be described by minimizing the sum of agents' local objective functions, has recently attracted widespread attention owing to its applications in diverse domains. In this paper, inspired by penalty method and subgradient descent method, a continuous-time neurodynamic approach is proposed for solving a DOP with inequality and set constraints. The state of continuous-time neurodynamic approach exists globally and converges to an optimal solution of the considered DOP. Comparisons reveal that the proposed neurodynamic approach can not only resolve more general convex DOPs, but also has lower dimension of solution space. Additionally, the discretization of the neurodynamic approach is also introduced for the convenience of implementation in practice. The iteration sequence of discrete-time method is also convergent to an optimal solution of DOP from any initial point. The effectiveness of the neurodynamic approach is verified by simulation examples and an application in L1-norm minimization problem in the end.