A class of algorithms using successive quadratic programming with perturbations and its global convergence

A class of algorithms using successive quadratic programming with perturbations and its global convergence

0.00 Avg rating0 Votes
Article ID: iaor19932009
Country: China
Volume: 10
Issue: 3
Start Page Number: 249
End Page Number: 255
Publication Date: Jul 1990
Journal: Journal of Systems Science and Complexity
Authors: ,
Abstract:

In this paper, a class of successive quadratic programming algorithms for NP is proposed. Instead of exact linear approximations in subproblems like Han’s, linear approximations with perturbed items are used. To obtain global convergence, a new function for choosing the step-length is developed. [In Chinese.]

Reviews

Required fields are marked *. Your email address will not be published.