Abstract: The Nelder-Mead simplex method is a well-known algorithm enabling the minimization of functions that are not available in closed-form and that need not be differentiable or convex.
Abstract: This paper presents a descent algorithm for the continuous convex piecewise linear network flow problem (CCPWLNFP). The CCPWLNFP can be reformulated as a linear programming problem and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results