Polynomial barrier function algorithms for convex quadratic programming
Joint Authors
Bin Daya, Muhammad
Shetty, C. M.
Source
The Arabian Journal for Science and Engineering
Issue
Vol. 15, Issue 4B (s) (31 Dec. 1990), pp.657-670, 14 p.
Publisher
King Fahd University of Petroleum and Minerals
Publication Date
1990-12-31
Country of Publication
Saudi Arabia
No. of Pages
14
Main Subjects
Engineering & Technology Sciences (Multidisciplinary)
Topics
Abstract EN
We present a primal polynomial-time barrier function algorithm for convex quadratic programming.
The algorithm considers the formulations with inequality constraints so that an unconstrained nonlinear programming subproblem is solved at each iteration.
The algorithm requires 0((nm15 + n2m)L) arithmetic operations
American Psychological Association (APA)
Bin Daya, Muhammad& Shetty, C. M.. 1990. Polynomial barrier function algorithms for convex quadratic programming. The Arabian Journal for Science and Engineering،Vol. 15, no. 4B (s), pp.657-670.
https://search.emarefa.net/detail/BIM-395262
Modern Language Association (MLA)
Bin Daya, Muhammad& Shetty, C. M.. Polynomial barrier function algorithms for convex quadratic programming. The Arabian Journal for Science and Engineering Vol. 15, no. 4B (s) (Dec. 1990), pp.657-670.
https://search.emarefa.net/detail/BIM-395262
American Medical Association (AMA)
Bin Daya, Muhammad& Shetty, C. M.. Polynomial barrier function algorithms for convex quadratic programming. The Arabian Journal for Science and Engineering. 1990. Vol. 15, no. 4B (s), pp.657-670.
https://search.emarefa.net/detail/BIM-395262
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 670
Record ID
BIM-395262
