论文信息 - The rise of nonlinear mathematical programming - 字舞流文

The rise of nonlinear mathematical programming

David A. McAllester

[1] Frédéric Benhamou,et al. Applying Interval Arithmetic to Real, Integer, and Boolean Constraints , 1997, J. Log. Program..

[2] David A. McAllester,et al. Solving Polynomial Systems Using a Branch and Prune Approach , 1997 .

[3] J. Verschelde,et al. Homotopies exploiting Newton polytopes for solving sparse polynomial systems , 1994 .

[4] Alexander P. Morgan,et al. Chemical equilibrium systems as numerical test problems , 1990, TOMS.

[5] A. Morgan,et al. Errata: Computing all solutions to polynomial systems using homotopy continuation , 1987 .

[6] E. Hansen,et al. An interval Newton method , 1983 .

[7] E. Hansen,et al. Bounding solutions of systems of equations using interval analysis , 1981 .

[8] Michel Cosnard,et al. Numerical Solution of Nonlinear Equations , 1979, TOMS.

[9] Ramon E. Moore,et al. SAFE STARTING REGIONS FOR ITERATIVE METHODS , 1977 .

[10] W. Older,et al. Extending Prolog with Constraint Arithmetic on Real Intervals , 1990 .

[11] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.