A generalized neural network for solving a class of minimax optimization problems with linear constraints

DOI10.1016/J.AMC.2012.01.020zbMATH Open1256.65061OpenAlexW2011030260MaRDI QIDQ433302FDOQ433302

Authors Yongqing Yang, Xianyun Xu, Jiao Liu, Jinde Cao

Publication date 13 July 2012

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2012.01.020

zbMATH Keywords

convergencenumerical examplesdifferential inclusionsneural networkprojection methodminimax optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)

Recommendations

• The neural network model for solving minimax problems with constraints
• scientific article; zbMATH DE number 529799
• A neural network for nonlinear programming with linear constraints
• A neural network theory for constrained optimization
• scientific article; zbMATH DE number 1727370
• Neural networks for a class of linearly constrained linear variational inequalities
• A neural network for solving nonlinear convex programming with linear equality and bounded constraints
• A new nonlinear neural network for solving a class of constrained parametric optimization problems

Cites work

• scientific article; zbMATH DE number 3855514 (Why is no real title available?)
• scientific article; zbMATH DE number 3716008 (Why is no real title available?)
• scientific article; zbMATH DE number 2163121 (Why is no real title available?)
• A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
• A Regularization Method for Solving the Finite Convex Min-Max Problem
• A new non-monotone SQP algorithm for the minimax problem
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
• An interval maximum entropy method for a discrete minimax problem
• Application of projection neural network in solving convex programming problems
• Delay-dependent stability analysis of numerical methods for stochastic delay differential equations
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
• Generalized Neural Network for Nonsmooth Nonlinear Programming Problems
• Linearly constrained minimax optimization
• Numerical solution for linear and quadratic programming problems using a recurrent neural network
• On the entropic regularization method for solving min-max problems with applications
• Optimization and nonsmooth analysis
• Risk management strategies via minimax portfolio optimization
• The optimization technique for solving a class of non-differentiable programming based on neural network method

Cited in

(8)

• Minimax Problems with Coupled Linear Constraints: Computational Complexity and Duality
• A proximal neurodynamic model for a system of non-linear inverse mixed variational inequalities
• The neural network model for solving minimax problems with constraints
• An optimization problem related to neural networks
• A proximal neurodynamic model for solving inverse mixed variational inequalities
• A new computationally simple approach for implementing neural networks with output hard constraints
• Two-timescale recurrent neural networks for distributed minimax optimization
• On a general decay stability of stochastic Cohen-Grossberg neural networks with time-varying delays

This page was built for publication: A generalized neural network for solving a class of minimax optimization problems with linear constraints

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