A new algorithm for minimizing convex functions over convex sets
暂无分享,去创建一个
[1] G. Bliss. Lectures on the calculus of variations , 1946 .
[2] S. Bochner,et al. Several complex variables , 1949 .
[3] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[4] Don Coppersmith,et al. Matrix multiplication via arithmetic progressions , 1987, STOC.
[5] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[6] Pravin M. Vaidya,et al. Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] J. Goffin,et al. Cutting planes and column generation techniques with the projective algorithm , 1990 .