Full Text:
<2593>
CLC number: O224
On-line Access:
Received: 1999-06-18
Revision Accepted: 2000-04-18
Crosschecked: 0000-00-00
Cited: 6
Clicked: 4971
SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM
| |||||||||||||
LIANG Xi-ming, MA Long-hua, QIAN Ji-xin. SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM[J]. Journal of Zhejiang University Science A, 2001, 2(1): 66-70.
@article{title="SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM",
author="LIANG Xi-ming, MA Long-hua, QIAN Ji-xin",
journal="Journal of Zhejiang University Science A",
volume="2",
number="1",
pages="66-70",
year="2001",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2001.0066"
}
%0 Journal Article
%T SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM
%A LIANG Xi-ming
%A MA Long-hua
%A QIAN Ji-xin
%J Journal of Zhejiang University SCIENCE A
%V 2
%N 1
%P 66-70
%@ 1869-1951
%D 2001
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2001.0066
TY - JOUR
T1 - SOLVING CONVEX QUADRATIC PROGRAMMING BY POTENTIAL-REDUCTION INTERIOR-POINT ALGORITHM
A1 - LIANG Xi-ming
A1 - MA Long-hua
A1 - QIAN Ji-xin
J0 - Journal of Zhejiang University Science A
VL - 2
IS - 1
SP - 66
EP - 70
%@ 1869-1951
Y1 - 2001
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2001.0066
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.
[1] Fletcher, R., 1987. Practical Methods of Optimization, 2nd edition. Wiley Pub, New York, p.115-174.
[2] Hock, W. and Schittkowski, K., 1981. Test Examples for Nonlinear Programming Codes. Springer, Berlin. p.26-140
[3] Kappor, S. and Vaidya, P. M., 1986. Fast algorithms for convex quadratic programming and multicommodity flows, Proceedings of the 18th Annual ACM Symposium on Theory of Computing. California, p.147-159.
[4] Karmarkar, N., 1984. A new polynomial time algorithm for linear programming. Combinatorica, 4:373-393.
[5] Kozlov, M. K., Tarasov, S. P. and Khachiyan, L. G., 1979. Polynomial solvability of convex quadratic programming. Soviet Mathematics Doklady, 20:1108-1111.
[6] Lucia, A. and Xu, J., 1990. Chemical process optimization using Newton-like methods. Comput. Chem. Engng., 14:119-138.
[7] Lucia, A., Xu, J. and D'Couto, G. C., 1993. Sparse quadratic programming in chemical process optimization. Ann. Oper. Res., 42:55-83.
[8] McCormick, G. P., 1983. Nonlinear Programming: Theory, Algorithms and Applications. John Wileg & Sons, Inc.Chichester, p.47-132.
[9] Monteiro, R. D. C., 1994. A globally convergent primal-dual interior point algorithm for convex programming. Mathematical Programming, 64: 123-147.
[10] Monteiro, R. D. C. and Adler, I., 1989. Interior path following primal-dual algorithms. Part II: Convex quadratic programming. Mathematical Programming, 44: 43-66.
[11] Schittkowski, K., 1987. More Test Examples for Nonlinear Programming Codes. Springer, Berlin, p.48-210.
[12] Vasantharajan, S., Viswanathan, J. and Biegler, L. T., 1990. Reduced successive quadratic programming implementation for large-scale optimization problems with smaller degrees of freedom. Comput. Chem. Engng., 14: 907-915.
[13] Ye, Y. and Tse, E., 1986. A polynomial algorithm for convex programming, Working Paper, Department of Engineering-Economic Systems. Stanford University, Stanford, CA. p.214-227
Open peer comments: Debate/Discuss/Question/Opinion
<1>