The optimization technique for solving a class of non-differentiable programming based on neural network method

DOI10.1016/j.nonrwa.2009.02.005zbMath1181.90251MaRDI QIDQ2655120

Cao, Jinde, Yongqing Yang

Publication date: 22 January 2010

Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nonrwa.2009.02.005

zbMATH Keywords

stability; convergence

Mathematics Subject Classification ID

90C30: Nonlinear programming

68T05: Learning and adaptive systems in artificial intelligence

Related Items

New stability criteria for neutral-type Cohen–Grossberg neural networks with discrete and distributed delays, A generalized neural network for solving a class of minimax optimization problems with linear constraints

Cites Work

• Unnamed Item
• A smoothing trust-region Newton-CG method for minimax problem
• An improved SQP algorithm for solving minimax problems
• New minimax algorithm
• An efficient approach to a class of non-smooth optimization problems
• On the entropic regularization method for solving min-max problems with applications
• Smooth transformation of the generalized minimax problem
• Nonmonotone line search algorithm for constrained minimax problems
• Neural network models and its application for solving linear and quadratic programming problems
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems
• An Efficient Method to Solve the Minimax Problem Directly
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
• A projection neural network and its application to constrained optimization problems
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• A high performance neural network for solving nonlinear programming problems with hybrid constraints
• Portfolio selection problem with minimax type risk function