Abstract
Several practical problems in computer science and computer engineering may be framed as convex optimization problems. Unlike a general optimization formulation that may be trapped in a local minimum, necessitating hill-climbing methods to crawl out of such a minimum, a convex optimization formulation has the attractive property that any local minimum is guaranteed to be a global minimum. This chapter presents an overview of the theory behind convex optimization and some illustrative examples of representative problems that are convex programs.
| Original language | English (US) |
|---|---|
| Title of host publication | Wiley Encyclopedia of Computer Science and Engineering |
| Publisher | Wiley |
| ISBN (Electronic) | 9780470050118 |
| ISBN (Print) | 9780471383932 |
| DOIs | |
| State | Published - Jan 1 2008 |
Bibliographical note
Publisher Copyright:© 2007 by John Wiley & Sons, Inc.
Keywords
- convex programming
- interior point methods
- optimization
Fingerprint
Dive into the research topics of 'Convex Optimization'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS