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 ...
9 NLPNRA: specifies the number of rows returned by the sparse Hessian module 10 NLPNMS, NLPQN: specifies the total number of constraints returned by the "nlc" module 11 NLPNMS, NLPQN: specifies the ...
SIAM Journal on Numerical Analysis, Vol. 22, No. 5 (Oct., 1985), pp. 821-850 (30 pages) We consider the problem of minimizing a smooth function of n variables subject to m smooth equality constraints.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results