A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case

From MaRDI portal





A multi-step algorithm for the minimization of a nondifferentiable function is presented. The method uses previous multi-step iterative information and curve search to generate new iterative points. The function under consideration is assumed to be convex with a nonempty set of minima. The algorithm uses the second-order Dini upper directional derivative. An estimate of the rate of convergence is given.











This page was built for publication: A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2853249)