论文信息 - Computable error bounds for nonlinear programming

Computable error bounds for nonlinear programming

This paper presents a method for obtaining computable bounds for the error in an approximate Kuhn—Tucker point of a nonlinear program. Techniques of interval analysis are employed to compute the error bounds.

Stephen M. Robinson | S. M. Robinson

[1] K. Nickel. On the Newton Method in Interval Analysis , 1971 .

[2] E. Hansen. On solving systems of equations using interval arithmetic , 1968 .

[3] J. M. Yohe,et al. An Interval Arithmetic Package for the UNIVAC 1108. , 1970 .

[4] Stephen M. Robinson,et al. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[5] Karl Nickel,et al. The algorithmic language triplex-Algol 60 , 1968 .

[6] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .