In this paper, based on calculus and penalty method, a one-layer recurrent neural network is proposed for solving constrained complex-variable convex optimization. It is proved that for any initial point from a given domain, the state of the proposed neural network reaches the feasible region in finite time and converges to an optimal solution of the constrained complex-variable convex optimization finally. In contrast to existing neural networks for complex-variable convex optimization, the proposed neural network has a lower model complexity and better convergence. Some numerical examples and application are presented to substantiate the effectiveness of the proposed neural network.
Multi-agent systems are widely studied due to its ability of solving complex tasks in many fields, especially in deep reinforcement learning. Recently, distributed optimization problem over multi-agent systems has drawn much attention because of its extensive applications. This paper presents a projection-based continuous-time algorithm for solving convex distributed optimization problem with equality and inequality constraints over multi-agent systems. The distinguishing feature of such problem lies in the fact that each agent with private local cost function and constraints can only communicate with its neighbors. All agents aim to cooperatively optimize a sum of local cost functions. By the aid of penalty method, the states of the proposed algorithm will enter equality constraint set in fixed time and ultimately converge to an optimal solution to the objective problem. In contrast to some existed approaches, the continuous-time algorithm has fewer state variables and the testification of the consensus is also involved in the proof of convergence. Ultimately, two simulations are given to show the viability of the algorithm.
In this paper, neurodynamic approaches are proposed for solving nonsmooth distributed optimization problems under inequality and set constraints, that is to find the solution that minimizes the sum of local cost functions. A continuous-time neurodynamic approach is designed and its state solution exists globally and converges to an optimal solution of the corresponding distributed optimization problem. Then, a neurodynamic approach with event-triggered mechanism is considered for the purpose of saving communication costs, and then, the convergence and its Zeno-free property are proved. Moreover, to realize the practical application of the neurodynamic approach, a discrete-time neurodynamic approach is proposed to solve nonsmooth distributed optimization problems under inequality and set constraints. It is rigorously proved that the iterative sequence generated by the discrete-time neurodynamic approach converges to the optimal solution set of the distributed optimization problem. Finally, numerical examples are solved to demonstrate the effectiveness of the proposed neurodynamic approaches, and the neurodynamic approach is further applied to solve the ill-conditioned Least Absolute Deviation problem and the load sharing optimization problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.