Partial Affine-Scaling for Linearly Constrained Minimization
暂无分享,去创建一个
[1] Paul Tseng,et al. Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set , 1993, SIAM J. Optim..
[2] Earl R. Barnes,et al. A variation on Karmarkar’s algorithm for solving linear programming problems , 1986, Math. Program..
[3] D. Bertsekas,et al. Distributed asynchronous optimal routing in data networks , 1984, The 23rd IEEE Conference on Decision and Control.
[4] Yinyu Ye,et al. On affine scaling algorithms for nonconvex quadratic programming , 1992, Math. Program..
[5] Yinyu Ye,et al. An extension of Karmarkar's projective algorithm for convex quadratic programming , 1989, Math. Program..
[6] Philip E. Gill,et al. Practical optimization , 1981 .
[7] Yinyu Ye,et al. A Short-Cut Potential Reduction Algorithm for Linear Programming , 1993 .
[8] Y. Ye,et al. On some efficient interior point methods for nonlinear convex programming , 1991 .
[9] D. Bertsekas,et al. Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.
[10] Kaoru Tone,et al. An active-set strategy in an interior point method for linear programming , 1991, Math. Program..
[11] D. Bertsekas. Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.
[12] Y. Ye,et al. Algorithms for the solution of quadratic knapsack problems , 1991 .
[13] George B. Dantzig,et al. Linear programming and extensions , 1965 .