13 References

[AG03]F. Alizadeh and D. Goldfarb. Second-order cone programming. Math. Programming, 95(1):3–51, 2003.
[ART03]E. D. Andersen, C. Roos, and T. Terlaky. On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Programming, February 2003.
[BT97]D. Bertsimas and J. N. Tsitsiklis. Introduction to linear optimization. Athena Scientific, 1997.
[BKVH07]S. Boyd, S.J. Kim, L. Vandenberghe, and A. Hassibi. A Tutorial on Geometric Programming. Optimization and Engineering, 8(1):67–127, 2007. Available at http://www.stanford.edu/~boyd/gp_tutorial.html.
[BV04]S. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2004. http://www.stanford.edu/~boyd/cvxbook/.
[CS14]Venkat Chandrasekaran and Parikshit Shah. Conic geometric programming. In Information Sciences and Systems (CISS), 2014 48th Annual Conference on, 1–4. IEEE, 2014.
[Cha09]Peter Robert Chares. Cones and interior-point algorithms for structed convex optimization involving powers and exponentials. PhD thesis, Ecole polytechnique de Louvain, Universitet catholique de Louvain, 2009.
[Chv83]V. Chvátal. Linear programming. W.H. Freeman and Company, 1983.
[GartnerM12]B. Gärtner and J. Matousek. Approximation algorithms and semidefinite programming. Springer Science & Business Media, 2012.
[Hac03]Y. Hachez. Convex optimization over non-negative polynomials: structured algorithms and applications. PhD thesis, Université Catholique De Lovain, 2003.
[LR05]M. Laurent and F. Rendl. Semidefinite programming and integer programming. Handbooks in Operations Research and Management Science, 12:393–514, 2005.
[LVBL98]M. S. Lobo, L. Vanderberghe, S. Boyd, and H. Lebret. Applications of second-order cone programming. Linear Algebra Appl., 284:193–228, November 1998.
[NW88]G. L. Nemhauser and L. A. Wolsey. Integer programming and combinatorial optimization. John Wiley and Sons, New York, 1988.
[Nes99]Yu. Nesterov. Squared functional systems and optimization problems. In H. Frenk, K. Roos, T. Terlaky, and S. Zhang, editors, High Performance Optimization. Kluwer Academic Publishers, 1999.
[NW06]J. Nocedal and S. Wright. Numerical optimization. Springer Science, 2nd edition, 2006.
[PS98]C. H. Papadimitriou and K. Steiglitz. Combinatorial optimization: algorithms and complexity. Dover publications, 1998.
[TV98]T. Terlaky and J.-Ph. Vial. Computing maximum likelihood estimators of convex density functions. SIAM J. Sci. Statist. Comput., 19(2):675–694, 1998.
[VB96]L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Rev., 38(1):49–95, March 1996.
[VAN10]J. P. Vielma, S. Ahmed, and G. Nemhauser. Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Operations research, 58(2):303–315, 2010.
[Wil93]H. P. Williams. Model building in mathematical programming. John Wiley and Sons, 3rd edition, 1993.
[Zie82]H Ziegler. Solving certain singly constrained convex optimization problems in production planning. Operations Research Letters, 1982. URL: http://www.sciencedirect.com/science/article/pii/016763778290030X.
[BenTalN01]A. Ben-Tal and A. Nemirovski. Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS/SIAM Series on Optimization. SIAM, 2001.