000000153 001 __ 153
000000153 005 __ 20241207085446.0
000000153 024 8_ $9 scholar $9 driver $a oai:ddd.uab.cat:153
000000153 035 __ $9 articleid $a 00255610v83n3p373
000000153 041 0_ $a eng
000000153 100 1_ $a Luksan, Ladislav
000000153 245 12 $a A bundle-Newton method for nonsmooth unconstrained minimization
000000153 251 __ $1 http://purl.org/coar/version/c_970fb48d4fbd8a85 $2 openaire4 $9 VoR $a Versió publicada
000000153 260 __ $c 1998
000000153 520 3_ $a An algorithm based on a combination of the polyhedral and quadratic approximation is given for finding stationary points for unconstrained minimization problems with locally Lipschitz problem functions that are not necessarily convex or differentiable. Global convergence of the algorithm is established. Under additional assumptions, it is shown that the algorithm generates Newton iterations and that the convergence is superlinear. Some encouraging numerical experience is reported..
000000153 540 __ $9 restricted access $a Aquest material està protegit per drets d'autor i/o drets afins. Podeu utilitzar aquest material en funció del que permet la legislació de drets d'autor i drets afins d'aplicació al vostre cas. Per a d'altres usos heu d'obtenir permís del(s) titular(s) de drets. $u https://rightsstatements.org/vocab/InC/1.0/
000000153 546 __ $a Anglès
000000153 599 __ $a recerca
000000153 653 1_ $a Nondifferentiable minimization
000000153 653 1_ $a Numerical methods
000000153 653 1_ $a Quadratic approximation
000000153 653 1_ $a Global convergence
000000153 653 1_ $a Superlinear convergence
000000153 655 _7 $1 http://purl.org/coar/resource_type/c_6501 $2 openaire4 $a Article $c literature
000000153 700 1_ $a Vlcek, Jan
000000153 773 __ $g vol. 83 n. 3 (1998) p. 373-391 $t Mathematical Programming $x 0025-5610
000000153 856 40 $p 19 $s 708838 $u https://ddd.uab.cat/uab/matpro/00255610v83n3p373.pdf
000000153 973 __ $f 373 $l 391 $m 11 $n 3 $v 83 $x 00255610v83n3 $y 1998
000000153 980 __ $a ARTPUB $b MATPRO