The nonconvex problem of minimum curvature is considered in detail and sufficient conditions for existence of solutions as well as characterizations are presented. The L ∞ minimization problem of ...

No algorithm for optimizing general nonlinear functions exists that will always find the global optimum for a general nonlinear minimization problem in a reasonable amount of time. Since no single ...

Mathematics of Computation, Vol. 71, No. 239 (Jul., 2002), pp. 1105-1135 (31 pages) We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in ...

There are several optimization techniques available in PROC NLMIXED. You can choose a particular optimizer with the TECH=name option in the PROC NLMIXED statement. No algorithm for optimizing general ...