Superlinearly Convergent Algorithms in Nonlinear Programming |
Contents
Sufficient Criteria for Determination | 8 |
An Upper Bound | 16 |
References | 21 |
5 other sections not shown
Common terms and phrases
algorithm 3.1 Algorithm for Nonlinear algorithms for solving assumptions Cauchy sequence compact set completes the proof constraints convergence rate convergence theorem convex exists Frobenius norm global convergence gradient h₁ holds implies Kuhn Kuhn-Tucker point Lemma Linear independence linear programming Lipschitz continuity matrix modified algorithm modified Lagrangian Newton's method nonlinear programming O.L. Mangasarian objective function Ortega and Rheinboldt P₁ perturbed subproblem PK+1 point of 1.1 positive definite Powell problem 1.1 programming problem prove Pshenichnyi's stepsize quadratic quadratic programming Quasi-Newton methods R-linear R-superlinear rate of convergence rithm Robinson root convergence factor satisfied sequence solution solving 1.1 stepsize methods sufficient condition superlinear convergence SUPERLINEARLY CONVERGENT ALGORITHMS T.J. Huang TSONG-JEN HUANG Tucker point unconstrained variable metric algorithms vectors W-sublinear Wilson's algorithm x₁ Xi+1 Xi+l z₁