• Home
  • Search
  • A Neural Network for Solving Nonlinear Programming Problems
  • Cite Icon38
  • https://doi.org/10.1007/s005210200022Copy DOI Icon

A Neural Network for Solving Nonlinear Programming Problems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A neural network for solving convex nonlinear programming problems is proposed in this paper. The distinguishing features of the proposed network are that the primal and dual problems can be solved simultaneously, all necessary and sufficient optimality conditions are incorporated, and no penalty parameter is involved. Based on Lyapunov, LaSalle and set stability theories, we prove strictly an important theoretical result that, for an arbitrary initial point, the trajectory of the proposed network does converge to the set of its equilibrium points, regardless of whether a convex nonlinear programming problem has unique or infinitely many optimal solutions. Numerical simulation results also show that the proposed network is feasible and efficient. In addition, a general method for transforming nonlinear programming problems into unconstrained problems is also proposed.

Similar Papers
  • Research Article
  • Citations1

SECOND-ORDER SYMMETRIC DUALITY IN MULTIOBJECTIVE PROGRAMMING OVER CONES

  • Jan 01, 2016
  • Journal of the Korean Mathematical Society
  • Tilak Raj Gulati +1
  • Conference Article
  • Citations3

Analog nonderivative optimizers

  • Jan 01, 1997
  • M.C.M Teixeira +1
  • Research Article

Optimality and duality in multiobjective programming involving higher order semilocally strong convexity

  • Jan 01, 2017
  • International Journal of Mathematics in Operational Research
  • I Ahmad +2
  • Research Article
  • Citations73

A dynamic system model for solving convex nonlinear optimization problems

  • Sep 06, 2011
  • Communications in Nonlinear Science and Numerical Simulation
  • A.R Nazemi
  • Conference Article
  • Citations1

Energy efficiency optimization of belt conveyors based on finite-time recurrent neural networks

  • Dec 01, 2017
  • Yanjun Shen +4
  • PDF
  • Research Article
  • Citations9

General-purpose preconditioning for regularized interior point methods

  • Nov 14, 2022
  • Computational Optimization and Applications
  • Jacek Gondzio +2
  • Research Article
  • Citations13

On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems

  • Oct 05, 2015
  • Applied Mathematics and Computation
  • Cheng Ma +1
  • Book Chapter
  • Citations23

Nonlinear Programming

  • Jan 01, 1984
  • B S Razumikhin
  • Book Chapter

Stabilizing Lagrange-Type Nonlinear Programming Neural Networks

  • Jun 03, 2007
  • Yuancan Huang
  • Research Article
  • Citations1

Variational Analysis on Local Sharp Minima via Exact Penalization

  • Jan 18, 2016
  • Set-Valued and Variational Analysis
  • Kaiwen Meng +1
  • Research Article
  • Citations36

An exact penalty function method for nonlinear mixed discrete programming problems

  • Aug 31, 2011
  • Optimization Letters
  • Changjun Yu +2
  • Research Article
  • Citations1

Converting general nonlinear programming problems into separable programming problems with feedforward neural networks

  • Feb 25, 2003
  • Neural Networks
  • B Lu
  • Research Article
  • Citations128

A novel neural network for nonlinear convex programming.

  • May 01, 2004
  • IEEE Transactions on Neural Networks
  • X.-B Gao
  • Research Article
  • Citations240

On generalised convex mathematical programming

  • Jul 01, 1992
  • The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
  • V Jeyakumar +1
  • Research Article
  • Citations6

A note on duality in homogeneous fractional programming

  • Mar 01, 1979
  • Naval Research Logistics Quarterly
  • B D Craven +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.