Logarithmic Barrier Function Method for Convex Quadratic Programming Problem

Xinghua Wang, Wen Liu, Pingping Qin and Lifeng Sun

Modern Applied Science, 2008, vol. 2, issue 4, 144

Abstract: In this paper, we present a kind of interior point algorithm for solving Convex Quadratic Programming problem using Logarithmic Barrier Function. In which Newton Method and Interior Penalty Function Method are combined to obtain a simple construct and easily calculating algorithm. In each iterate it needs only to solve an equality constrained Quadratic Programming problem. Â

Date: 2008
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/2451/2301 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/2451 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:2:y:2008:i:4:p:144

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().