Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
A Duality Theorem for Convex Programs
Home
Publications
A Duality Theorem for Convex Programs
A Duality Theorem for Convex Programs
Author:
WD
W. S. Dorn
W. S. Dorn
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Publisher website
Google Scholar
1 October 1960
journal article
Published by
IBM
in
IBM Journal of Research and Development
Vol. 4
(4)
,
407-413
DOI:
10.1147/rd.44.0407
Abstract
A proof is given for a duality theorem for a class of convex programs, i.e., constrained minimization of convex functions. A simple example is included.
Keywords
CONVEX PROGRAM
CONVEX FUNCTION
SIMPLE EXAMPLE
DUALITY THEOREM
CONVEX PROGRAMMING
Related articles
Cited
Cited by 42 articles
Scroll to top