Abstract
We describe graph implementations, a generic method for representing a convex function via its epigraph, described in a disciplined convex programming framework. This simple and natural idea allows a very wide variety of smooth and nonsmooth convex programs to be easily specified and efficiently solved, using interiorpoint methods for smooth or cone convex programs.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alizadeh, F., Goldfarb, D.: Second-order cone programming (January 2004)
Bertsekas, D.P.: Convex Analysis and Optimization. In: Nedić, A., Ozdaglar, A.E. (eds.) Athena Scientific (2003)
Bland, R., Goldfarb, D., Todd, M.: The ellipsoid method: A survey. Operations Research 29(6), 1039–1091 (1981)
Borwein, J., Lewis, A.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, Heidelberg (2000)
Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms and Engineering Applications. MPS/SIAM Series on Optimization. SIAM, Philadelphia (2001)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge Univ. Press, Cambridge (2004), http://www.stanford.edu/~boyd/cvxbook.html
Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
Grant, M., Boyd, S.: CVX: MATLAB® software for disciplined convex programming, version 1.1 (September 2007), http://www.stanford.edu/~boyd/cvx/
Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization: from Theory to Implementation, Nonconvex Optimization and Its Applications, pp. 155–210. Springer Science+Business Media, Inc., New York (2006)
Grant, M.: Disciplined Convex Programming. PhD thesis, Department of Electrical Engineering, Stanford University (December 2004)
Löfberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB®. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004), http://control.ee.ethz.ch/~joloef/yalmip.php
Lobo, M., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra and its Applications 284, 193–228 (1998) (special issue on Signals and Image Processing)
MOSEK ApS. Mosek (software package) (September 2007), http://www.mosek.com
Nesterov, Yu., Nemirovsky, A.: Interior-Point Polynomial Algorithms in Convex Programming: Theory and Algorithms of Studies in Applied Mathematics, vol. 13. SIAM Publications, Philadelphia, PA (1993)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Sturm, J.: Using SeDuMi 1.02, a MATLAB® toolbox for optimization over symmetric cones. Optimization Methods and Software 11, 625–653 (1999), Updated version available at http://sedumi.mcmaster.ca
Toh, K., Todd, M., Tutuncu, R.: SDPT3 — a MATLAB® software package for semidefinite programming. Optimization Methods and Software 11, 545–581 (1999)
Vanderbei, R.: LOQO: An interior point code for quadratic programming. Optimization Methods and Software 11, 451–484 (1999)
Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Review 38(1), 49–95 (1996)
van Tiel, J.: Convex Analysis. An Introductory Text. John Wiley & Sons, Chichester (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grant, M.C., Boyd, S.P. (2008). Graph Implementations for Nonsmooth Convex Programs. In: Blondel, V.D., Boyd, S.P., Kimura, H. (eds) Recent Advances in Learning and Control. Lecture Notes in Control and Information Sciences, vol 371. Springer, London. https://doi.org/10.1007/978-1-84800-155-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-84800-155-8_7
Publisher Name: Springer, London
Print ISBN: 978-1-84800-154-1
Online ISBN: 978-1-84800-155-8
eBook Packages: EngineeringEngineering (R0)