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

Authors:
Bao-Liang Lu;Koji Ito
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, 1954 Hua Shan Road, 200030 Shanghai, People's Republic of China;Department of Computational Intelligence and System Science, Tokyo Institute of Technology, 4259, Nagatsuta, Midori-ku, Yokohama 226-8502, Japan
Venue:
Neural Networks
Year:
2003

Citing 12
Cited 0

Multilayer feedforward networks are universal approximators

Neural Networks
On the approximate realization of continuous mappings by neural networks

Neural Networks
Transformation of nonlinear programming problems into separable ones using multilayer neural networks

MANNA '95 Proceedings of the first international conference on Mathematics of neural networks : models, algorithms and applications: models, algorithms and applications
Natural gradient works efficiently in learning

Neural Computation
Neural Networks: A Comprehensive Foundation

Neural Networks: A Comprehensive Foundation
Fundamentals of Robotics: Analysis and Control

Fundamentals of Robotics: Analysis and Control
Neural Networks for Pattern Recognition

Neural Networks for Pattern Recognition
Neural Networks for Statistical Modeling

Neural Networks for Statistical Modeling
Adaptive Method of Realizing Natural Gradient Learning for Multilayer Perceptrons

Neural Computation
On the relationship between generalization error, hypothesis complexity, and sample complexity for radial basis functions

Neural Computation
Comparison of adaptive methods for function estimation from samples

IEEE Transactions on Neural Networks
Inverting feedforward neural networks using linear and nonlinear programming

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a method for converting general nonlinear programming (NLP) problems into separable programming (SP) problems by using feedforward neural networks (FNNs). The basic idea behind the method is to use two useful features of FNNs: their ability to approximate arbitrary continuous nonlinear functions with a desired degree of accuracy and their ability to express nonlinear functions in terms of parameterized compositions of functions of single variables. According to these two features, any nonseparable objective functions and/or constraints in NLP problems can be approximately expressed as separable functions with FNNs. Therefore, any NLP problems can be converted into SP problems. The proposed method has three prominent features. (a) It is more general than existing transformation techniques; (b) it can be used to formulate optimization problems as SP problems even when their precise analytic objective function and/or constraints are unknown; (c) the SP problems obtained by the proposed method may highly facilitate the selection of grid points for piecewise linear approximation of nonlinear functions. We analyze the computational complexity of the proposed method and compare it with an existing transformation approach. We also present several examples to demonstrate the method and the performance of the simplex method with the restricted basis entry rule for solving SP problems.