Author:
Ariyawansa K. A.,Jiang P. L.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization
Reference14 articles.
1. Burke, J. V., Goldstein, A. A., Tseng, P., and Ye, Y., Translational Cuts for Convex Minimization, Complexity in Numerical Optimization, Edited by P. M. Pardalos, World Scientific Publishing Company, River Edge, New Jersey,pp. 57–73, 1993.
2. Goldstein, A. A., A Global Newton Method, Applied Geometry and Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, Rhode Island, Vol. 4, pp. 301–307, 1991.
3. Hertog, D. D., Roos, C., and Terlaky, T., A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems, SIAM Journal on Optimization, Vol. 2, pp. 55–70, 1992.
4. Lecture Notes in Mathematics;F. Jarre,1989
5. Mehrotra, S., and Sun, J., An Interior-Point Algorithm for Solving Smooth Convex Programs Based on Newton's Method, Mathematical Developments Arising from Linear Programming, Contemporary Mathematics, Edited by J. C. Lagarias and M. J. Todd, American Mathematical Society, Providence, Rhode Island, Vol. 114, pp. 265–284, 1990.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献