Disciplined convex-concave programming

2016 IEEE 55th Conference on Decision and Control, CDC 2016

Volumn , Issue , 2016, Pages 1009-1014

  Shen, Xinyue ^a   Diamond, Steven ^b   Gu, Yuantao ^a   Boyd, Stephen ^b  

^a TSINGHUA UNIVERSITY   (China)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85010782674     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2016.7798400     Document Type: Conference Paper

References (40)

1. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press, 2004.
2. P. Hartman, "On functions representable as a difference of convex functions," Pacific Journal of Math, vol. 9, no. 3, pp. 707-713, 1959.
3. R. M. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computation, R. E. Miller and J. W. Thatcher, Eds. Plenum, 1972, pp. 85-104.
4. Y. Lou, S. Osher, and J. Xin, Computational aspects of constrained L1-L2 minimization for compressive sensing, ser. Advances in Intelligent Systems and Computing, 2015, vol. 359, pp. 169-180.
5. L. T. H. An, H. M. Le, V. V. Nguyen, and P. D. Tao, "A DC programming approach for feature selection in support vector machines learning," Advances in Data Analysis and Classification, vol. 2, no. 3, pp. 259-278, 2008.
6. C. J. Yu and T. Joachims, "Learning structural svms with latent variables," in Proceedings of the 26th Annual International Conference on Machine Learning, ser. ICML '09. ACM, 2009, pp. 1169-1176.
7. L. T. Hoai An, H. M. Le, and P. D. Tao, "Feature selection in machine learning: An exact penalty approach using a difference of convex function algorithm," Machine Learning, vol. 101, no. 1-3, pp. 163-186, 2015.
8. R. Collobert, F. Sinz, J. Weston, and L. Bottou, "Trading convexity for scalability," in Proceedings of the 23rd International Conference on Machine Learning, ser. ICML '06. ACM, 2006, pp. 201-208.
9. Y. Lou, T. Zeng, S. Osher, and J. Xin, "A weighted difference of anisotropic and isotropic total variation model for image processing," SIAM Journal on Imaging Sciences, vol. 8, no. 3, pp. 1798-1823, 2015.
10. T. Lipp and S. Boyd, "Antagonistic control," http://web.stanford.edu/-boyd/papers/antag control.html, March 2015.
11. S. Boyd, M. Hast, and K. J. A ström, "Mimo pid tuning via iterated lmi restriction," International Journal of Robust and Nonlinear Control, 2015.
12. T. Schüle, C. Schnörr, S. Weber, and J. Hornegger, "Discrete tomography by convex-concave regularization and D.C. programming," Discrete Applied Mathematics, vol. 151, no. 1-3, pp. 229-243, 2005.
13. Z. Liu and H. Qiao, "A convex-concave relaxation procedure based subgraph matching algorithm," in ACML 237-252.
14. J. Thai, T. Hunter, A. K. Akametalu, C. J. Tomlin, and A. M. Bayen, "Inverse covariance estimation from data with missing values using the concave-convex procedure," in Decision and Control (CDC), 2014 IEEE 53rd Annual Conference on. IEEE, 2014, pp. 5736-5742.
15. L. D. Muu, "A convex-concave programming method for optimizing over the efficient set," Acta Mathematica Vietnamica, vol. 25, no. 1, pp. 67-85, 2000.
16. N. Agin, "Optimum seeking with branch and bound," Management Science, vol. 13, pp. 176-185, 1966.
17. E. L. Lawler and D. E. Wood, "Branch-and-bound methods: A survey," Operations Research, vol. 14, pp. 699-719, 1966.
18. L. D. Muu, "An algorithm for solving convex programs with an additional convex-concave constraint," Mathematical Programming, vol. 61, no. 1, pp. 75-87, 1993.
19. R. Horst, P. M. Pardalos, and N. V. Thoai, Introduction to Global Optimization. Dordrecht, Netherlands: Kluwer Academic Publishers, 1995.
20. R. Horst and N. V. Thoai, "DC programming: overview," Journal of Optimization Theory and Applications, vol. 103, no. 1, pp. 1-43, 1999.
21. J. Nocedal and S. J. Wright, Numerical Optimization. Springer, 2006.
22. A. L. Yuille and A. Rangarajan, "The concave-convex procedure," Neural Computation, vol. 15, no. 4, pp. 915-936, 2003.
23. G. R. Lanckriet and B. K. Sriperumbudur, "On the convergence of the concave-convex procedure," in Advances in neural information processing systems, 2009, pp. 1759-1767.
24. K. Lange, D. R. Hunter, and I. Yang, "Optimization transfer using surrogate objective functions," Journal of Computational and Graphical Statistics, vol. 9, no. 1, pp. 1-20, 2000.
25. R. J. A. Little and D. B. Rubin, Statistical Analysis with Missing Data. New York, New York: John Wiley & Sons, 1987.
26. K. Lange, Optimization, ser. Springer Texts in Statistics. New York, New York: Springer, 2004.
27. G. McLachlan and T. Krishnan, The EM algorithm and extensions. John Wiley & Sons, 2007.
28. P. D. Tao and E. B. Souad, "Algorithms for solving a class of nonconvex optimization problems. Methods of subgradients," in FERMAT Days 85: Mathematics for Optimization, J.-B. Hiriart-Urruty, Ed. Elsevier Scince Publishers B. V., 1986, pp. 249-271.
29. L. T. H. An, "DC programming and DCA: local and global approaches-theory, algorithms and applications," http://lita.sciences.univ-metz.fr/-lethi/DCA.html, 2015.
30. T. Lipp and S. Boyd, "Variations and extension of the convex-concave procedure," Optimization and Engineering, pp. 1-25, 2015.
31. M. Grant, S. Boyd, and Y. Ye, "Disciplined convex programming," in Global Optimization: From Theory to Implementation, ser. Nonconvex Optimization and its Applications, L. Liberti and N. Maculan, Eds. Springer, 2006, pp. 155-210.
32. M. Grant and S. Boyd, "Graph implementation for nonsmooth convex programs," in Recent Advances in Learning and Control, ser. Lecture Notes in Control and Information Sciences, V. Blondel, S. Boyd, and H. Kimura, Eds. Springer-Verlag, 2008.
33. Y. Nesterov and A. Nemirovsky, "Conic formulation of a convex programming problem and duality," Optimization Methods and Software, vol. 1, no. 2, pp. 95-115, 1992.
34. J. Lofberg, "YALMIP: A toolbox for modeling and optimization in MATLAB," in Proceedings of the IEEE International Symposium on Computed Aided Control Systems Design, Sept. 2004, pp. 294-289.
35. CVX Research, Inc., "CVX: Matlab software for disciplined convex programming, version 2.0," http://cvxr.com.cvx, Aug. 2012.
36. S. Diamond and S. Boyd, "CVXPY: A Python-embedded modeling language for convex optimization," To appear, Journal of Machine Learning Research, 2016.
37. M. Udell, K. Mohan, D. Zeng, J. Hong, S. Diamond, and S. Boyd, "Convex optimization in Julia," in Proceedings of the Workshop for High Performance Technical Computing in Dynamic Languages, 2014, pp. 18-28.
38. J. C. Latombe, Robot Motion Planning. Kluwer Academic Publishers, 1991.
39. A. Miele, T. Wang, C. S. Chao, and J. B. Dabney, "Optimal control of a ship for collision avoidance maneuvers," Journal of Optimization Theory and Applications, vol. 103, no. 3, pp. 495-519, 1999.
40. E. J. Candès and M. B. Wakin, "An introduction to compressive sampling," IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21-30, 2008.