How good are projection methods for convex feasibility problems? Nicholas I. M. Gould OriginalPaper 23 October 2007 Pages: 1 - 12
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches Mohamed HaouariSafa Bhar LayebHanif D. Sherali OriginalPaper 23 October 2007 Pages: 13 - 39
Local analysis of the feasible primal-dual interior-point method R. SilvaJ. SoaresL. N. Vicente OriginalPaper 16 October 2007 Pages: 41 - 57
A modified trust region method with Beale’s PCG technique for optimization Wenyu SunLiusheng HouChuangying Dang OriginalPaper 15 November 2007 Pages: 59 - 72
Finding preferred subsets of Pareto optimal solutions Gio K. KaoSheldon H. Jacobson OriginalPaper 23 October 2007 Pages: 73 - 95
The convergence analysis of inexact Gauss–Newton methods for nonlinear problems Jinhai Chen OriginalPaper 26 October 2007 Pages: 97 - 118