Resultats globals: 3 registres trobats en 0.01 segons.
Articles, 3 registres trobats
Articles 3 registres trobats  
1.
22 p, 782.7 KB Predictor-corrector algorithm for solving P_* (k)-matrix LCP from arbitrary positive starting points / Potra, Florian A. ; Rongqin, Sheng
A new predictor-corrector algorithm is proposed for solving P_*(k)-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting point (x^0, s^0). [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 223-244  
 Accés restringit a la UAB
2.
19 p, 692.2 KB A bundle-Newton method for nonsmooth unconstrained minimization / Luksan, Ladislav ; Vlcek, Jan
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. [...]
1998
Mathematical Programming, vol. 83 n. 3 (1998) p. 373-391  
 Accés restringit a la UAB
3.
19 p, 655.9 KB A preconditioning proximal Newton method for nondifferentiable convex optimization / Qi, Liqun ; Chen, Xiaojun
We propose a proximal Newton method for solving nondifferentiable convex optimization. This method combines the generalized Newton method with Rockafellar's proximal point algorithm. At each step, the proximal point is found approximately and the regularization matrix is preconditioned to overcome inexactness of this approximation. [...]
1997
Mathematical Programming, vol. 76 n. 3 (1997) p. 411-429  
 Accés restringit a la UAB

Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.