A discrete-time neural network for solving nonlinear convex problems with hybrid constraints

DOI10.1016/j.amc.2007.05.034zbMath1135.90047OpenAlexW1989167860MaRDI QIDQ2470165

Yanyan Li

Publication date: 13 February 2008

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

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

zbMATH Keywords

nonlinear programmingglobal exponential stabilitydiscrete-time neural networkprimal-dual solutionvariational inequalities problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items

A discrete-time projection neural network for solving degenerate convex quadratic optimization ⋮ Periodicity and exponential stability of discrete-time neural networks with variable coefficients and delays ⋮ Robust linear neural network for constrained quadratic optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• New alternating direction method for a class of nonlinear variational inequality problems
• Solving complementarity and variational inequalities problems using neural networks
• Numerical solutions for constrained quadratic problems using high-performance neural networks
• A high performance neural network for solving nonlinear programming problems with hybrid constraints
• Improvements of some projection methods for monotone nonlinear variational inequalities

This page was built for publication: A discrete-time neural network for solving nonlinear convex problems with hybrid constraints