Bounding Global Minima
暂无分享,去创建一个
Conditions are given which are sufficient to prove the existence of a unique unconstrained minimizer in a convex compact set. An exact formula is given for the amount by which a value of the function exceeds its global minimum.
[1] Garth P. McCormick,et al. Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..
[2] K. Nickel. On the Newton Method in Interval Analysis , 1971 .
[3] E. Hansen. On solving systems of equations using interval arithmetic , 1968 .