An interior point method for quadratic programs based on conjugate projected gradients
暂无分享,去创建一个
[1] A. Stuart,et al. Portfolio Selection: Efficient Diversification of Investments , 1959 .
[2] G. R. Walsh,et al. Methods Of Optimization , 1976 .
[3] H. Markowitz. Portfolio Selection: Efficient Diversification of Investments , 1971 .
[4] M. A. Jenkins. DOMINO: an APL primitive function for matrix inversion -- -- its implementation and applications , 1972, SIGP.
[5] Philip E. Gill,et al. Practical optimization , 1981 .
[6] Trond Steihaug,et al. Truncated-newtono algorithms for large-scale unconstrained optimization , 1983, Math. Program..
[7] Gene H. Golub,et al. Matrix computations , 1983 .
[8] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .
[9] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[10] Michael A. Saunders,et al. On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method , 1986, Math. Program..
[11] Earl R. Barnes,et al. A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..
[12] R. Fletcher. Practical Methods of Optimization , 1988 .
[13] David Kendrick,et al. GAMS, a user's guide , 1988, SGNM.
[14] J. L. Nazareth. Pricing criteria in linear programming , 1988 .
[15] Clyde L. Monma,et al. An Implementation of a Primal-Dual Interior Point Method for Linear Programming , 1989, INFORMS J. Comput..
[16] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part II: Convex quadratic programming , 1989, Math. Program..
[17] Yinyu Ye,et al. An extension of Karmarkar's projective algorithm for convex quadratic programming , 1989, Math. Program..
[18] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[19] Clóvis C. Gonzaga,et al. Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method , 1991, SIAM J. Optim..
[20] Donald Goldfarb,et al. An O(n3L) primal interior point algorithm for convex quadratic programming , 1991, Math. Program..
[21] I. Lustig,et al. Computational experience with a primal-dual interior point method for linear programming , 1991 .
[22] D. Ponceleón. Barrier methods for large-scale quadratic programming , 1991 .
[23] Sanjay Mehrotra,et al. On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..
[24] Roy E. Marsten,et al. On Implementing Mehrotra's Predictor-Corrector Interior-Point Method for Linear Programming , 1992, SIAM J. Optim..
[25] John M. Mulvey,et al. Separable Quadratic Programming via a Primal-Dual Interior Point Method and its Use in a Sequential Procedure , 1993, INFORMS J. Comput..
[26] Robert J. Vanderbei,et al. ALPO: Another Linear Program Optimizer , 1993, INFORMS J. Comput..
[27] Robert J. Vanderbei,et al. Symmetric indefinite systems for interior point methods , 1993, Math. Program..