An extension of predictor–corrector algorithm to a class of convex separable program

An extension of predictor–corrector algorithm to a class of convex separable program

0.00 Avg rating—0 Votes
Article ID: iaor19981904
Country: China
Volume: 13
Issue: 4
Start Page Number: 363
End Page Number: 370
Publication Date: Oct 1997
Journal: Acta Mathematicae Applicanda Sinica
Authors: ,
Keywords: programming: nonlinear, programming: convex
Abstract:

The predictor–corrector algorithm for linear programming, presented by Mizuno et al., has become the best-known of the interior point methods. In this paper it is modified and then extended to solve a class of separable programming problems.

Reviews

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