Convex optimization in Julia

Proceedings of HPTCDL 2014: 1st Workshop for High Performance Technical Computing in Dynamic Languages - Held in Conjunction with SC 2014: The International Conference for High Performance Computing, Networking, Storage and Analysis

Volumn , Issue , 2014, Pages 18-28

  Udell, Madeleine ^a   Mohan, Karanveer ^a   Zeng, David ^a   Hong, Jenny ^a   Diamond, Steven ^a   Boyd, Stephen ^a  

^a NONE

Author keywords

automatic verification; Convex programming; multiple dispatch; symbolic computation

Indexed keywords

COMPLIANCE CONTROL; COMPUTATIONAL LINGUISTICS; OPTIMIZATION; TREES (MATHEMATICS);

ABSTRACT SYNTAX TREES; AUTOMATIC VERIFICATION; CONCISE REPRESENTATIONS; FUNCTIONAL LANGUAGES; GLOBAL STRUCTURE; MULTIPLE DISPATCH; OPTIMIZATION MODELING; SYMBOLIC COMPUTATION;

CONVEX OPTIMIZATION;

EID: 84946686891     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPTCDL.2014.5     Document Type: Conference Paper

References (54)

1. F. Alizadeh and D. Goldfarb. Second-order cone programming. Mathematical programming, 95(1):3-51, 2003.
2. D. Ariens, B. Houska, and H. Ferreau. Acado for Matlab user's manual. www.acadotoolkit.org, 2010-2011.
3. S. Becker, E. Candes, and M. Grant. TFOCS: Flexible first-order methods for rank minimization. In Low-rank Matrix Optimization Symposium, SIAM Conference on Optimization, 2011.
4. J. Bezanson, J. Chen, S. Karpinski, V. Shah, and A. Edelman. Array operators using multiple dispatch: a design methodology for array implementations in dynamic languages. arXiv preprint arXiv:1407.3845, 2014.
5. J. Bezanson, S. Karpinski, V. B. Shah, and A. Edelman. The Julia language. http://julialang.org/.
6. J. Bezanson, S. Karpinski, V. B. Shah, and A. Edelman. Julia: A fast dynamic language for technical computing. arXiv preprint arXiv:1209.5145, 2012.
7. L. T. Biegler and V. M. Zavala. Large-scale nonlinear programming using ipopt: An integrating framework for enterprise-wide dynamic optimization. Computers & Chemical Engineering, 33(3):575-582, 2009.
8. S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein. Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1):1-122, 2011.
9. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
10. A. Brooke, D. Kendrick, A. Meeraus, and R. Raman. The general algebraic modeling system. GAMS Development Corporation, 1998.
11. M. R. Bussieck and A. Meeraus. General algebraic modeling system (GAMS). In Modeling languages in mathematical optimization, pages 137-157. Springer, 2004.
12. E. Chu, N. Parikh, A. Domahidi, and S. Boyd. Code generation for embedded second-order cone programming. In European Control Conference (ECC), pages 1547-1552. IEEE, 2013.
13. CPLEX, IBM ILOG. V12.1: User's manual for CPLEX. International Business Machines Corporation, 46(53):157, 2009.
14. C. Crusius. Automated analysis of convexity properties of nonlinear programs. PhD thesis, Stanford University, 2003.
15. S. Diamond, E. Chu, and S. Boyd. CVXPY: A Python-embedded modeling language for convex optimization, version 0.2. http://cvxpy.org/, May 2014.
16. A. Domahidi, E. Chu, and S. Boyd. ECOS: An SOCP solver for embedded systems. In European Control Conference, Zurich, Switzerland, 2013.
17. R. Fourer, D. Gay, and B. Kernighan. AMPL. Boyd & Fraser, 1993.
18. R. Fourer, C. Maheshwari, A. Neumaier, D. Orban, and H. Schicl. Convexity and concavity detection in computation graphs: Tree walks for convexity assessment. INFORMS Journal on Computing, 22:26-43, 2010.
19. Frontline Solvers. Excel solver, optimization software, Monte Carlo simulation, data mining-Frontline Systems. www.solver.com.
20. K. Fujisawa, M. Kojima, and K. Nakata. SDPA (semidefinite programming algorithm) useraAZs manual, version 4.10. Technical report, Department of Mathematical and Computing Science, Tokyo Institute of Technology, Tokyo, 1998.
21. M. Grant and S. Boyd. Graph implementations for nonsmooth convex programs. In V. Blondel, S. Boyd, and H. Kimura, editors, Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pages 95-110. Springer, 2008.
22. M. Grant, S. Boyd, and Y. Ye. Disciplined convex programming. In L. Liberti and N. Maculan, editors, Global Optimization: From Theory to Implementation, Nonconvex Optimization and its Applications, pages 155-210. Springer, 2006.
23. M. Grant, S. Boyd, and Y. Ye. CVX: Matlab software for disciplined convex programming, ver. 2.0, build 870. http://cvxr.com, Sept. 2012.
24. B. Houska and H. Ferreau. ACADO toolkit user's manual. www.acadotoolkit.org, 2009-2011.
25. B. Houska, H. Ferreau, and M. Diehl. ACADO Toolkit-An open source framework for automatic control and dynamic optimization. Optimal Control Applications and Methods, 32(3):298-312, 2011.
26. S. G. Johnson. The NLopt nonlinear-optimization package, 2010.
27. L. V. Kantorovich. On a mathematical symbolism convenient for performing machine calculations. Dokl. Akad. Nauk SSSR, 113(4):738-741, 1957.
28. N. Karmarkar. A new polynomial-time algorithm for linear programming. In Proceedings of the 16th annual ACM Symposium on Theory of Computing, pages 302-311. ACM, 1984.
29. C. Lattner and V. Adve. LLVM: A compilation framework for lifelong program analysis & transformation. In International Symposium on Code Generation and Optimization, pages 75-86. IEEE, 2004.
30. T. Lipp and S. Boyd. Variations and extensions of the convex-concave procedure. http://stanford.edu/~boyd/papers/cvx-ccv.html, 2014.
31. M. S. Lobo, L. Vandenberghe, S. Boyd, and H. Lebret. Applications of second-order cone programming. Linear Algebra and Its Applications, 284:193-228, 1998.
32. J. Lofberg. YALMIP: A toolbox for modeling and optimization in MATLAB. In IEEE International Symposium on Computed Aided Control Systems Design, pages 294-289, Sep 2004.
33. M. Lubin and I. Dunning. Computing in operations research using Julia. arXiv preprint arXiv:1312.1431, 2013.
34. A. Makhorin. GLPK (GNU linear programming kit), 2008.
35. J. Mattingley and S. Boyd. CVXGEN: A code generator for embedded convex optimization. Optimization and Engineering, 13:1-27, 2012.
36. A. Mosek. The MOSEK optimization software. 54, 2010.
37. G. Nemhauser and L. Wolsey. Integer and combinatorial optimization, volume 18. Wiley New York, 1988.
38. A. S. Nemirovsky and D. B. Yudin. Informational Complexity and Efficient Methods for Solution of Convex Extremal Problems. Wiley, New York, 1983.
39. I. P. Nenov, D. H. Fylstra, and L. V. Kolev. Convexity determination in the Microsoft Excel solver using automatic differentiation techniques. In Fourth International Workshop on Automatic Differentiation, 2004.
40. Y. Nesterov. Interior-point methods: An old and new approach to nonlinear programming. Mathematical Programming, 79(1):285-297, 1997.
41. Y. Nesterov. Introductory lectures on convex optimization: A basic course, volume 87. Springer, 2004.
42. Y. Nesterov and A. Nemirovskii. Interior-point polynomial algorithms in convex programming, volume 13. SIAM, 1994.
43. B. O'Donoghue, E. Chu, N. Parikh, and S. Boyd. Operator splitting for conic optimization via homogeneous self-dual embedding. arXiv preprint arXiv:1312.3039, 2013.
44. G. Optimization. Gurobi optimizer reference manual. 2012.
45. D. R. Stoutmeyer. Automatic categorization of optimization problems: An application of computer symbolic mathematics. Operations Research, 26:773-738, 1978.
46. The Computational Infrastructure for Operations Research project. COIN-OR linear program solver. 2014.
47. M. Udell and S. Boyd. Maximizing a sum of sigmoids. http://stanford.edu/~boyd/papers/max-sum- sigmoids.html, 2013.
48. M. Udell and S. Boyd. Bounding duality gap for separable functions. arXiv preprint arXiv:1410.4158, 2014.
49. M. Udell, C. Horn, R. Zadeh, and S. Boyd. Generalized low rank models. arXiv preprint arXiv:1410.0342, 2014.
50. T. Van Voorhis and F. A. Al-Khayyal. Difference of convex solution of quadratically constrained optimization problems. European Journal of Operational Research, 148(2):349-362, 2003.
51. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM review, 38(1):49-95, 1996.
52. H. Wolkowicz, R. Saigal, and L. Vandenberghe. Handbook of semidefinite programming: theory, algorithms, and applications, volume 27. Springer, 2000.
53. L. Wolsey. Integer programming, volume 42. Wiley New York, 1998.
54. S.-P. Wu and S. Boyd. SDPSOL: A parser/solver for SDP and MAXDET problems with matrix structure. Available at www.stanford.edu/~boyd/old- software/SDPSOL.html, Nov 1995.