Skip to main content
Journal Article

Graph implementations for nonsmooth convex programs

Lecture Notes in Control and Information Sciences (2008) 371 95-110
DOI: 10.1007/978-1-84800-155-8_7
2.2kCitations
Citations of this article
432Readers
Mendeley users who have this article in their library.
Get full text

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 interior-point methods for smooth or cone convex programs. © 2008 Springer London.

Author supplied keywords

Cite

CITATION STYLE

APA

Grant, M. C., & Boyd, S. P. (2008). Graph implementations for nonsmooth convex programs. Lecture Notes in Control and Information Sciences, 371, 95–110. https://doi.org/10.1007/978-1-84800-155-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free