Data fitting with geometric-programming-compatible softmax functions
- 314 Downloads
Motivated by practical applications in engineering, this article considers the problem of approximating a set of data with a function that is compatible with geometric programming (GP). Starting with well-established methods for fitting max-affine functions, it is shown that improved fits can be obtained using an extended function class based on the softmax of a set of affine functions. The softmax is generalized in two steps, with the most expressive function class using an implicit representation that allows fitting algorithms to locally tune softness. Each of the proposed function classes is directly compatible with the posynomial constraint forms in GP. Max-monomial fitting and posynomial fitting are shown to correspond to fitting special cases of the proposed implicit softmax function class. The fitting problem is formulated as a nonlinear least squares regression, solved locally using a Levenberg–Marquardt algorithm. Practical implementation considerations are discussed. The article concludes with numerical examples from aerospace engineering and electrical engineering.
KeywordsConvex optimization Convex regression Geometric programming
The authors thank Aude Hofleitner, Timothy Hunter, and several anonymous reviewers for their thorough and insightful comments on the draft. This work was supported by a National Science Foundation Graduate Research Fellowship.
- Agarwal S, Mierle K (2010) Others: ceres solver. http://ceres-solver.org
- Babakhani A, Lavaei J, Doyle J, Hajimiri A (2010) Finding globally optimum solutions in antenna optimization problems. In: IEEE international symposium on antennas and propagationGoogle Scholar
- Chiang M (2005) Geometric programming for communication systems. Commun Inf Theory 2:1–154. doi:10.1516/0100000005. http://portal.acm.org/citation.cfm?id=1166381.1166382
- Drela M (2000) Xfoil subsonic airfoil development system. Open source software. http://web.mit.edu/drela/Public/web/xfoil/
- Hannah L, Dunson D (2012) Ensemble methods for convex regression with applications to geometric programming based circuit design. arXiv preprint. http://arxiv.org/abs/1206.4645
- Hannah LA, Dunson DB (2011) Multivariate convex regression with adaptive partitioning. arXiv preprint. http://arxiv.org/abs/1105.1924
- Li X, Gopalakrishnan P, Xu Y, Pileggi T (2004) Robust analog/rf circuit design with projection-based posynomial modeling. In: Proceedings of the 2004 IEEE/ACM international conference on computer-aided design, pp 855–862. IEEE computer societyGoogle Scholar
- Marquardt DW (1963) An algorithm for least-squares estimation of nonlinear parameters. J Soc Ind Appl Math 11(2):431–441. http://www.jstor.org/stable/2098941
- Nesterov Y, Nemirovsky A (1994) Interior-point polynomial methods in convex programming, volume 13 of studies in applied mathematics. SIAM, PhiladelphiaGoogle Scholar
- Oliveros J, Cabrera D, Roa E, Van Noije W (2008) An improved and automated design tool for the optimization of cmos otas using geometric programming. In: Proceedings of the 21st annual symposium on integrated circuits and system design, pp 146–151. ACMGoogle Scholar
- Wilde D (1978) Globally optimal design. Wiley, New York. http://books.google.com/books?id=XYBRAAAAMAAJ