Publishing Service

Polishing & Checking

Journal of Zhejiang University SCIENCE A

ISSN 1673-565X(Print), 1862-1775(Online), Monthly

2001 Vol.2 No.1 P.66-70

SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM

College of Information Science & Engineering, Central South University, Changsha 410083, China; Institute of Systems Engineering, National Lab of Industrial Control Technology, Zhejiang University,Hangzhou 310027, China

Abstract: The solution of quadratic programming problems is an important issue in the field of mathematical programming and industrial applications. In this paper, we solve convex quadratic programming by a potential-reduction interior-point algorithm. It is proved that the potential-reduction interior-point algorithm is globally convergent. Some numerical experiments were made.

Key words: potential-reduction interior-point algorithm, convex quadratic programming, convergence, numerical experiments


Share this article to： More

Go to Contents

References:

<Show All>

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





DOI:

10.1631/jzus.2001.0066

CLC number:

O224

Download Full Text:

Click Here

Downloaded:

2499

Clicked:

4866

Cited:

6

On-line Access:

Received:

1999-06-18

Revision Accepted:

2000-04-18

Crosschecked:

Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952276; Fax: +86-571-87952331; E-mail: jzus@zju.edu.cn
Copyright © 2000~ Journal of Zhejiang University-SCIENCE