Source:http://linkedlifedata.com/resource/pubmed/id/16592378
Switch to
| Predicate | Object |
|---|---|
| rdf:type | |
| lifeskim:mentions | |
| pubmed:issue |
1
|
| pubmed:dateCreated |
2010-6-29
|
| pubmed:abstractText |
The problem of concern is the minimization of a convex function over a normed space (such as a Hilbert space) subject to the constraints that a number of other convex functions are not positive. As is well known, there is a dual maximization problem involving Lagrange multipliers. Some of the constraint functions are linear, and so the Uzawa, Stoer, and Witzgall form of the Slater constraint qualifications is appropriate. A short elementary proof is given that the infimum of the first problem is equal to the supremum of the second problem.
|
| pubmed:commentsCorrections | |
| pubmed:language |
eng
|
| pubmed:journal | |
| pubmed:status |
PubMed-not-MEDLINE
|
| pubmed:month |
Jan
|
| pubmed:issn |
0027-8424
|
| pubmed:author | |
| pubmed:issnType |
Print
|
| pubmed:volume |
74
|
| pubmed:owner |
NLM
|
| pubmed:authorsComplete |
Y
|
| pubmed:pagination |
26-8
|
| pubmed:dateRevised |
2010-9-15
|
| pubmed:year |
1977
|
| pubmed:articleTitle |
Convex programs having some linear constraints.
|
| pubmed:affiliation |
Department of Mathematics, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213.
|
| pubmed:publicationType |
Journal Article
|