A global solution to the nonlinear model predictive control algorithms using polynomial ARX models

[1]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

[2]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[3]  Reiner Horst,et al.  An algorithm for nonconvex programming problems , 1976, Math. Program..

[4]  Karla L. Hoffman,et al.  A method for globally minimizing concave functions over convex sets , 1981, Math. Program..

[5]  J. B. Rosen,et al.  Methods for global concave minimization: A bibliographic survey , 1986 .

[6]  Katta G. Murty,et al.  Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[7]  David D. Brengel,et al.  Multistep nonlinear predictive controller , 1989 .

[8]  C. Floudas,et al.  A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory , 1990 .

[9]  A. A. Patwardhan,et al.  NONLINEAR MODEL PREDICTIVE CONTROL , 1990 .

[10]  Miguel J. Bagajewicz,et al.  On the Generalized Benders Decomposition , 1991 .

[11]  C. Floudas,et al.  Primal-relaxed dual global optimization approach , 1993 .

[12]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[13]  J. Rawlings,et al.  The stability of constrained receding horizon control , 1993, IEEE Trans. Autom. Control..

[14]  Christodoulos A. Floudas,et al.  New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints , 1993, J. Glob. Optim..

[15]  Yaman Arkun,et al.  On the global solution to nonlinear model predictive control algorithms that use polynomial models , 1994 .