A one-layer projection neural network for nonsmooth optimization subject to linear equalities and bound constraints

Area of Science:

• Computational Mathematics
• Artificial Intelligence
• Optimization Theory

Background:

• Nonsmooth optimization problems are prevalent in various scientific and engineering fields.
• Existing recurrent neural networks for these problems often require parameter tuning, complicating their application.
• Generalized convex functions and linear/bound constraints present significant challenges in optimization.

Purpose of the Study:

• To introduce a novel one-layer projection neural network for solving nonsmooth optimization problems.
• To design a neural network model that eliminates the need for design parameters, facilitating easier implementation.
• To analyze the convergence properties of the proposed network for pseudoconvex objective functions under linear and bound constraints.

Main Methods:

• Development of a one-layer projection neural network architecture.
• Integration of two distinct projection operators for linear equality and bound constraints.
• Mathematical proof of global convergence to optimal solutions for pseudoconvex objective functions.

Main Results:

• The proposed neural network effectively handles nonsmooth objective functions that are pseudoconvex over the constraint set.
• The absence of design parameters simplifies the model's application and implementation.
• Numerical simulations validate the network's effectiveness and demonstrate its convergence characteristics.

Conclusions:

• The presented projection neural network offers a parameter-free and efficient approach to solving a class of nonsmooth optimization problems.
• The model's global convergence property for pseudoconvex functions makes it a reliable tool for optimization tasks.
• This work contributes a valuable computational method for tackling complex optimization challenges in artificial intelligence and computational mathematics.