MM algorithms for geometric and signomial programming

Mathematical Programming

Volumn 143, Issue 1-2, 2014, Pages 339-356

  Lange, Kenneth ^a   Zhou, Hua ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

Arithmetic geometric mean inequality; Geometric programming; Global convergence; Linearly constrained quadratic programming; MM algorithm; Parameter separation; Penalty method; Signomial programming

Indexed keywords

EID: 84895060129     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0612-1     Document Type: Article

References (25)

1. Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (1999)
2. Borwein, J.M.; Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, New York (2000)
3. Boyd, S.; Kim, S.J.; Vandenberghe, L.; Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8, 67-127 (2007)
4. Boyd, S.; Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
5. del Mar Hershenson, M.; Boyd, S.P.; Lee, T.H.: Optimal design of a CMOS op-amp via geometric programming. IEEE Trans Comput. Aided Des. 20, 1-21 (2001)
6. Ecker, J.G.: Geometric programming: methods, computations and applications. SIAM Rev. 22, 338-362 (1980)
7. Feigin, P.D.; Passy, U.: The geometric programming dual to the extinction probability problem in simple branching processes. Ann. Prob. 9, 498-503 (1981)
8. Hoffman, K.: Analysis in Euclidean Space. Prentice-Hall, Englewood Cliffs (1975)
9. Hunter, D.R.; Lange, K.: A tutorial on MM algorithms. Am. Stat. 58, 30-37 (2004)
10. Lange, K.: Optimization. Springer, New York (2004)
11. Lange, K.; Hunter, D.R.; Yang, I.: Optimization transfer using surrogate objective functions (with discussion). J Comput Graph. Stat. 9, 1-59 (2000)
12. Mazumdar, M.; Jefferson, T.R.: Maximum likelihood estimates for multinomial probabilities via geometric programming. Biometrika 70, 257-261 (1983)
13. Nocedal, J.; Wright, S.J.: Numer. Optim. Springer, Berlin (1999)
14. Passy, U.; Wilde, D.J.: A geometric programming algorithm for solving chemical equilibrium problems. SIAM J Appl Math. 16, 363-373 (1968)
15. Peressini, A.L.; Sullivan, F.E.; Uhl, J.J. Jr.: The Mathematics of Nonlinear Programming. Springer, New York (1988)
16. Peterson, E.L.: Geometric programming. SIAM Rev. 18, 338-362 (1976)
17. Ruszczynski, A.: Optimization. Princeton University Press, Princeton (2006)
18. Sha, F.; Saul, L.K.; Lee, D.D.: Multiplicative updates for nonnegative quadratic programming in support vector machines. In: Becker, S.; Thrun, S.; Obermayer, K. (eds.) Advances in Neural Information Processing Systems, vol. 15, pp. 1065-1073. MIT Press, Cambridge
19. Steele, J.M.: The Cauchy-Schwarz Master Class: An Introduction to the Art of Inequalities. Cambridge University Press and the Mathematical Association of America, Cambridge (2004)
20. Wang, Y.; Zhang, K.; Shen, P.: A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming. Math. Comput. Model. 35, 1209-1219 (2002)
21. Zhou, H.; Alexander, D.; Lange, K.L.: A quasi-Newton acceleration method for high-dimensional optimization algorithms. Stat. Comput. 21, 173-261 (2011)
22. Zhou, H.; Lange, K.L.: MM algorithms for some discrete multivariate distributions. J. Comput. Graph. Stat 19(3), 645-665 (2010)
23. Zhou, H.; Lange, K.L.: A fast procedure for calculating importance weights in bootstrap sampling. Comput. Stat. Data Anal. 55, 26-33 (2011)
24. Zhou, H.; Lange, K.L.: Path following in the exact penalty method of convex programming. arXiv:1201.3593 (2011)
25. Zhou, H.; Lange, K.L.; Suchard, M.A.: Graphical processing units and high-dimensional optimization. Stat. Sci. 25(3), 311-324 (2010)