ISSN:
0945-3245
Keywords:
AMS(MOS): 65K05
;
CR:5.15
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary The paper represents an outcome of an extensive comparative study of nonlinear optimization algorithms. This study indicates that quadratic approximation methods which are characterized by solving a sequence of quadratic subproblems recursively, belong to the most efficient and reliable nonlinear programming algorithms available at present. The purpose of this paper is to analyse the theoretical convergence properties and to investigate the numerical performance in more detail. In Part 1, the exactL 1-penalty function of Han and Powell is replaced by a differentiable augmented Lagrange function for the line search computation to the able to prove the global convergence and to show that the steplength one is chosen in the neighbourhood of a solution. In Part 2, the quadratic subproblem is exchanged by a linear least squares problem to improve the efficiency, and to test the dependence of the performance from different solution methods for the quadratic or least squares subproblems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01395811
Permalink
