{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:52:08Z","timestamp":1770994328109,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T00:00:00Z","timestamp":1351209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10107-012-0612-1","type":"journal-article","created":{"date-parts":[[2012,10,25]],"date-time":"2012-10-25T10:26:19Z","timestamp":1351160779000},"page":"339-356","source":"Crossref","is-referenced-by-count":36,"title":["MM algorithms for geometric and signomial programming"],"prefix":"10.1007","volume":"143","author":[{"given":"Kenneth","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,26]]},"reference":[{"key":"612_CR1","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific (1999)"},{"key":"612_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-9859-3","volume-title":"Convex Analysis and Nonlinear Optimization: Theory and Examples","author":"JM Borwein","year":"2000","unstructured":"Borwein, J.M., Lewis, A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, New York (2000)"},{"key":"612_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s11081-007-9001-7","volume":"8","author":"S Boyd","year":"2007","unstructured":"Boyd, S., Kim, S.J., Vandenberghe, L., Hassibi, A.: A tutorial on geometric programming. Optim. Eng. 8, 67\u2013127 (2007)","journal-title":"Optim. Eng."},{"key":"612_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"612_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/43.905671","volume":"20","author":"M Mar Hershenson del","year":"2001","unstructured":"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\u201321 (2001)","journal-title":"IEEE Trans Comput. Aided Des."},{"key":"612_CR6","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/1022058","volume":"22","author":"JG Ecker","year":"1980","unstructured":"Ecker, J.G.: Geometric programming: methods, computations and applications. SIAM Rev. 22, 338\u2013362 (1980)","journal-title":"SIAM Rev."},{"key":"612_CR7","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1214\/aop\/1176994422","volume":"9","author":"PD Feigin","year":"1981","unstructured":"Feigin, P.D., Passy, U.: The geometric programming dual to the extinction probability problem in simple branching processes. Ann. Prob. 9, 498\u2013503 (1981)","journal-title":"Ann. Prob."},{"key":"612_CR8","volume-title":"Analysis in Euclidean Space","author":"K Hoffman","year":"1975","unstructured":"Hoffman, K.: Analysis in Euclidean Space. Prentice-Hall, Englewood Cliffs (1975)"},{"key":"612_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1198\/0003130042836","volume":"58","author":"DR Hunter","year":"2004","unstructured":"Hunter, D.R., Lange, K.: A tutorial on MM algorithms. Am. Stat. 58, 30\u201337 (2004)","journal-title":"Am. Stat."},{"key":"612_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4182-7","volume-title":"Optimization","author":"K Lange","year":"2004","unstructured":"Lange, K.: Optimization. Springer, New York (2004)"},{"key":"612_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"K Lange","year":"2000","unstructured":"Lange, K., Hunter, D.R., Yang, I.: Optimization transfer using surrogate objective functions (with discussion). J Comput Graph. Stat. 9, 1\u201359 (2000)","journal-title":"J Comput Graph. Stat."},{"key":"612_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1093\/biomet\/70.1.257","volume":"70","author":"M Mazumdar","year":"1983","unstructured":"Mazumdar, M., Jefferson, T.R.: Maximum likelihood estimates for multinomial probabilities via geometric programming. Biometrika 70, 257\u2013261 (1983)","journal-title":"Biometrika"},{"key":"612_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numer. Optim.","author":"J Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numer. Optim. Springer, Berlin (1999)"},{"key":"612_CR14","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0116030","volume":"16","author":"U Passy","year":"1968","unstructured":"Passy, U., Wilde, D.J.: A geometric programming algorithm for solving chemical equilibrium problems. SIAM J Appl Math. 16, 363\u2013373 (1968)","journal-title":"SIAM J Appl Math."},{"key":"612_CR15","doi-asserted-by":"crossref","unstructured":"Peressini, A.L., Sullivan, F.E., Uhl, J.J. Jr.: The Mathematics of Nonlinear Programming. Springer, New York (1988)","DOI":"10.1007\/978-1-4612-1025-2"},{"key":"612_CR16","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/1018001","volume":"18","author":"EL Peterson","year":"1976","unstructured":"Peterson, E.L.: Geometric programming. SIAM Rev. 18, 338\u2013362 (1976)","journal-title":"SIAM Rev."},{"key":"612_CR17","volume-title":"Optimization","author":"A Ruszczynski","year":"2006","unstructured":"Ruszczynski, A.: Optimization. Princeton University Press, Princeton (2006)"},{"key":"612_CR18","unstructured":"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\u20131073. MIT Press, Cambridge"},{"key":"612_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511817106","volume-title":"The Cauchy-Schwarz Master Class: An Introduction to the Art of Inequalities","author":"JM Steele","year":"2004","unstructured":"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)"},{"key":"612_CR20","doi-asserted-by":"crossref","first-page":"1209","DOI":"10.1016\/S0895-7177(02)00080-8","volume":"35","author":"Y Wang","year":"2002","unstructured":"Wang, Y., Zhang, K., Shen, P.: A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming. Math. Comput. Model. 35, 1209\u20131219 (2002)","journal-title":"Math. Comput. Model."},{"key":"612_CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11222-009-9166-3","volume":"21","author":"H Zhou","year":"2011","unstructured":"Zhou, H., Alexander, D., Lange, K.L.: A quasi-Newton acceleration method for high-dimensional optimization algorithms. Stat. Comput. 21, 173\u2013261 (2011)","journal-title":"Stat. Comput."},{"issue":"3","key":"612_CR22","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1198\/jcgs.2010.09014","volume":"19","author":"H Zhou","year":"2010","unstructured":"Zhou, H., Lange, K.L.: MM algorithms for some discrete multivariate distributions. J. Comput. Graph. Stat 19(3), 645\u2013665 (2010)","journal-title":"J. Comput. Graph. Stat"},{"key":"612_CR23","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.csda.2010.04.019","volume":"55","author":"H Zhou","year":"2011","unstructured":"Zhou, H., Lange, K.L.: A fast procedure for calculating importance weights in bootstrap sampling. Comput. Stat. Data Anal. 55, 26\u201333 (2011)","journal-title":"Comput. Stat. Data Anal."},{"key":"612_CR24","unstructured":"Zhou, H., Lange, K.L.: Path following in the exact penalty method of convex programming. arXiv:1201.3593 (2011)"},{"issue":"3","key":"612_CR25","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1214\/10-STS336","volume":"25","author":"H Zhou","year":"2010","unstructured":"Zhou, H., Lange, K.L., Suchard, M.A.: Graphical processing units and high-dimensional optimization. Stat. Sci. 25(3), 311\u2013324 (2010)","journal-title":"Stat. Sci."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0612-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0612-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0612-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T18:35:00Z","timestamp":1714502100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0612-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,26]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["612"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0612-1","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,26]]}}}