A Novel Neural Network for a Class of Convex Quadratic Minimax Problems
From MaRDI portal
Publication:5423494
DOI10.1162/neco.2006.18.8.1818zbMath1185.90205OpenAlexW2118817910MaRDI QIDQ5423494
Publication date: 23 October 2007
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco.2006.18.8.1818
Related Items (4)
A Dynamical Splitting Method for Minimizing the Sum of Three Convex Functions ⋮ A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems ⋮ A dynamical model for solving degenerate quadratic minimax problems with constraints ⋮ A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
Cites Work
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- On the stability of globally projected dynamical systems
- Inexact implicit methods for monotone general variational inequalities
- A neural network for monotone variational inequalities with linear constraints
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- Global asymptotic and exponential stability of a dynamic neural system with asymmetric connection weights
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Linear-Quadratic Programming and Optimal Control
- An Extended Projection Neural Network for Constrained Optimization
- Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- On convergence rate of projection neural networks
- Stability analysis of gradient-based neural networks for optimization problems
This page was built for publication: A Novel Neural Network for a Class of Convex Quadratic Minimax Problems
