[1]Dantzig G B. Programming in a linear structure. Report of the September Meeting in Madison, 1949, 17: 73-74.
[2]Dantzig G B,章祥赧杜链.回顾线性规划的起源,运筹学杂志,1984, (1): 71-78.
[3]Bazaraa M S, Sherali H D, Shetty C M. Nonlinear Programming: Theroy and Algorithms. New York: John Wiley & Sons, 2004.
[4]Luenberger D G, Ye Y. Linear and Nonlinear Programming. Berlin: Springer, 2015.
[5]Khachiyan L G. A new polynomial algorithm in linear programming. Soviet Mathematics Doklady, 1979, 20: 191-194.
[6]Karmarkar N K. A new polynomial-time algorithm for linear programming. Combinatorica, 1984, 4: 373-395.
[7]Klee V, Minty G J. Inequalities. New York: Academic Press, 1972: 159-175.
[8]Nesterov Y, Nemirovski A. Interior Point Polynomial Methods in Convex Programming: Theroy and Algorithms. Philadelphia: SIAM Publications, 1993.
[9]Bai Y Q. Kernal Function-based Interior-point Algorithm for Conic Optimization. Beijing: Science Press, 2010.
[10]袁亚湘.非线性规划——现状与进展.运筹学杂志,1989, 8(1): 12-22.
[11]Arjovsky M, Chintala S. Wasserstein generative adversarial networks. Pro- cedinges of the 34th International Conference on Machine Learning, 2017.
[12]Cuturi M. Sinkhorn distances: Lightspeed computation of optimal transport. Advances in Neural Information Processing Systems, 2013, 26: 2292- 2300.
[13]Villani C. Optimal Transport: Old and New. Berlin: Springer Science & Business Media, 2008.
[14]Dvurechensky P, Gasnikov A, Kroshnin A. Computational optimal transport: Complexity by accelerated gradient descent is better than by Sinkhorn^ algorithm. Proceedings of the 35th International Conference on Machine Learning (ICML), 2018, 80: 1367.
[15]Hinton G E, Salakhutdinov R R. Reducing the dimensionality of data with neural networks. Science, 2006, 313: 504-507.
[16]Nemirovski A. Advances in convex optimization: Conic programming. Marta Sanz Sole, 2006, 1: 413-444.
[17]Boyd S, Vandenberghe L. Convex Optimization. Cambridge: Cambridge University Press, 2004.
[18]Alizadeh F, Goldfarb D. Second-order cone programming. Mathematical Programming, 2003, 95: 3-51.
[19]Anjos M F, Lasserre J B. Handbook on Semidefinite, Conic and Polynomial Optimization. Berlin: Springer-Verlag, 2012.
[20]Ben-Tai A, Nemirovski A. Lectures on Modern Convex Optimization. Philadelphia: SIAM Publications, 2001.
[21]Yang L Q, Sun D F, Toh K C. SDPNAL+: A majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Mathematical Programming Computation, 2015, 7: 331-366.
[22]Li Y, Wen Z, Yang C. A Semi-Smooth Newton Method for Solving Semidefinite Programs in Electronic Structure Calculations. Beijing: Peking University, 2017.
[23]Bomze I, Diir M, Teo C P. Copositive optimization. Mathematical Optimization Society Newsletter, Optima, 2012, 89: 2-8.
[24]方述诚,邢文训,线性锥优化.北京:科学出版社,2013.
[25]张立卫.锥约束优化:最优性理论与增广Lagrange方法.北京:科学出版社, 2010.
[26]Zhao X Y, Sun D F, Toh K C. A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM Journal on Optimization, 2010, 20: 1737-1765.
[27]Yann L C, Bengio Y S, Hinton G. Deep learning. Nature, 2015, 521: 436-444.
[28]Peiia J, Vera J C, Zuluaga L F. Completely positive reformulations for polynomial optimization. Mathematical Programming, 2015, 151: 405-431.