| Gfrerer,H., Guddat,J., and Wacker,J., A globally convergent algorithm based on embedding and parametric optimization, Computing 30 (1983), 225-52. |
....(regular problems in the sense of Jongen, Jonker and Twilt) cf. Definition 2:4) For the analysis with respect to JJT regular problems, we will assume a higher degree of differentiability of the problemfunctions. Let us recall now the well known concept of embedding (cf. e.g. 1] 2] 4] [9], 10] 11] 13] 21] 22] 24] Construct a one parametric optimization problem P (t) minff(y; t)jy 2 M (t)g; t 2 [0; 1] where M(t) fy 2 IR n jh i (y; t) 0; i 2 I; g j (y; t) 0; j 2 Jg n n, J is a finite index set with J J , with at least the following ....
Gfrerer,H., Guddat,J., and Wacker,J., A globally convergent algorithm based on embedding and parametric optimization, Computing 30 (1983), 225-52.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC