Nonsmooth exclusion test for finding all solutions of nonlinear equations

[1]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[2]  Paul I. Barton,et al.  McCormick-Based Relaxations of Algorithms , 2009, SIAM J. Optim..

[3]  A. Neumaier.  Complete search in continuous global optimization and constraint satisfaction , 2004, Acta Numerica.

[4]  Angelo Lucia,et al.  Global Terrain Methods , 2002, Encyclopedia of Optimization.

[5]  Marko Mäkelä,et al.  Survey of Bundle Methods for Nonsmooth Optimization , 2002, Optim. Methods Softw..

[6]  J. Seader,et al.  Global homotopy continuation procedures for seeking all roots of a nonlinear equation , 2001 .

[7]  Jan Vlcek,et al.  Algorithm 811: NDA: algorithms for nondifferentiable optimization , 2001, TOMS.

[8]  P. I. Barton,et al.  DAEPACK: An Open Modeling Environment for Legacy Models , 2000 .

[9]  L. Luksan,et al.  Globally Convergent Variable Metric Method for Convex Nonsmooth Unconstrained Minimization1 , 1999 .

[10]  Johannes P. Schlöder,et al.  On the Role of Natural Level Functions to Achieve Global Convergence for Damped Newton Methods , 1999, System Modelling and Optimization.

[11]  Jan Vlcek,et al.  A bundle-Newton method for nonsmooth unconstrained minimization , 1998, Math. Program..

[12]  R. B. Kearfott.  Rigorous Global Search: Continuous Problems , 1996 .

[13]  M. Stadtherr,et al.  Robust process simulation using interval methods , 1996 .

[14]  Christodoulos A. Floudas,et al.  Finding all solutions of nonlinearly constrained systems of equations , 1995, J. Glob. Optim..

[15]  Ross E. Swaney,et al.  Robust solution of algebraic process modelling equations , 1994 .

[16]  R. Baker Kearfott,et al.  Algorithm 681: INTBIS, a portable interval Newton/bisection package , 1990, TOMS.

[17]  R. Baker Kearfott,et al.  Preconditioners for the interval Gauss-Seidel method , 1990 .

[18]  M. Kuno,et al.  Computing all real solutions to systems of nonlinear equations with a global fixed-point homotopy , 1988 .

[19]  M. R. Osborne,et al.  A note on solving nonlinear equations and the natural criterion function , 1987 .

[20]  R. B. Kearfott,et al.  Abstract generalized bisection and a cost bound , 1987 .

[21]  J. D. Seader,et al.  Computing multiple solutions to systems of interlinked separation columns , 1987 .

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

[23]  Jorge J. Moré,et al.  Testing Unconstrained Optimization Software , 1981, TOMS.

[24]  Ramon E. Moore,et al.  A Simple Test for Accuracy of Approximate Solutions to Nonlinear (or Linear) Systems , 1980 .

[25]  Ramon E. Moore.  A Test for Existence of Solutions to Nonlinear Systems , 1977 .

[26]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[27]  P. Deuflhard.  A modified Newton method for the solution of ill-conditioned systems of nonlinear equations with application to multiple shooting , 1974 .

[28]  P. I. Barton,et al.  Subgradient Propagation for McCormick Relaxations , 2007 .

[29]  Andreas Griewank,et al.  Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[30]  J. K. Reid,et al.  MA48: A FORTRAN code for direct solution of sparse unsymmetric linear systems of equations , 1993 .

[31]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[32]  Steven A. Johnson,et al.  Mapped continuation methods for computing all solutions to general systems of nonlinear equations , 1990 .

[33]  Ramon E. Moore.  Methods and applications of interval analysis , 1979, SIAM studies in applied mathematics.