Solving convex programming problems with equality constaints by neural networks
From MaRDI portal
DOI10.1016/S0898-1221(98)00172-2zbMATH Open0941.90060OpenAlexW2022203442MaRDI QIDQ1125028FDOQ1125028
Authors: S. H. Smith 
Publication date: 29 November 1999
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00172-2
Recommendations
- A neural network for solving nonlinear convex programming with linear equality and bounded constraints
- Application of projection neural network in solving convex programming problems
- scientific article; zbMATH DE number 529799
- A neural network for nonlinear programming with linear constraints
- A deterministic annealing neural network for convex programming
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Neural networks and physical systems with emergent collective computational abilities
- Title not available (Why is that?)
- Neurons with graded response have collective computational properties like those of two-state neurons
- Title not available (Why is that?)
- ``Neural computation of decisions in optimization problems
- An approach to nonlinear programming
- Title not available (Why is that?)
- An inexact approach to solving linear semi-infinite programming problems
- Title not available (Why is that?)
- A deterministic annealing neural network for convex programming
- Title not available (Why is that?)
- Analysis and design of a recurrent neural network for linear programming
- Delay structure conditions for identifiability of closed loop systems
- Title not available (Why is that?)
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
- Neural networks for constrained optimization problems
- A new neural network for solving linear programming problems
- Unifying the Tank and Hopfield linear programming circuit and the canonical nonlinear programming circuit of Chua and Lin
- Complete stability of autonomous reciprocal nonlinear networks
Cited In (16)
- Application of projection neural network in solving convex programming problems
- Convergence analysis of a differential equation approach for solving nonlinear programming problems
- Existence and stability of equilibria of the continuous-time Hopfield neural network
- Title not available (Why is that?)
- Solving nonlinear complementarity problems with neural networks: A reformulation method approach
- Numerical solutions for constrained quadratic problems using high-performance neural networks
- Finite-time synchronization of coupled Cohen-Grossberg neural networks with and without coupling delays
- Numerical solution for linear and quadratic programming problems using a recurrent neural network
- A neural network for solving nonlinear convex programming with linear equality and bounded constraints
- A novel method to handle inequality constraints for convex programming neural network
- A deterministic annealing neural network for convex programming
- Primal-dual solution for the linear programming problems using neural networks
- Solving complementarity and variational inequalities problems using neural networks
- Novel global exponential stability criterion for recurrent neural networks with time-varying delay
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints
- A novel neural network for solving semidefinite programming problems with some applications
This page was built for publication: Solving convex programming problems with equality constaints by neural networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1125028)
