We present a new finite algorithm for quadratic programming. Our algorithm is based on the solution procedures of linear programming (pivoting, Bland's rule, Hungarian Methods, criss-cross method), however this method does not require the enlargement of the basic tableau as Frank-Wolfe method does.
β¦ LIBER β¦
A New Algorithm for a Special Quadratic Programming Model
β Scribed by V.S.S. SURESH BABU
- Book ID
- 125649994
- Publisher
- Springer-Verlag
- Year
- 1993
- Tongue
- English
- Weight
- 885 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0019-4670
- DOI
- 10.2307/29793659
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A new algorithm for quadratic programmin
β
TamΓ‘s Terlaky
π
Article
π
1987
π
Elsevier Science
π
English
β 531 KB
A new successive quadratic programming a
β
Zengxin Wei
π
Article
π
1992
π
Institute of Applied Mathematics, Chinese Academy
π
English
β 416 KB
A quadratic programming algorithm
β
M. J. Best; K. Ritter
π
Article
π
1988
π
Springer
π
English
β 820 KB
A quadratic programming algorithm
β
Johan Philip
π
Article
π
1966
π
Springer
π
English
β 764 KB
A new penalty function algorithm for con
β
M. Ben-Daya; K.S. Al-Sultan
π
Article
π
1997
π
Elsevier Science
π
English
β 607 KB
In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. Each iteration in the algorithm consists of a single Newton step followed by a reduction in the value of the penalty parameter. The points generated by the algorithm follow an e
A decomposition algorithm for quadratic
β
Richard S. Sacher
π
Article
π
1980
π
Springer-Verlag
π
English
β 696 KB