抄録
The minimizing problem for a convex program has a dual problem, that is, the maximizing problem of the Lagrangian. Although these problems have a duality gap in general, the duality gap can be eliminated by relaxing the constraint of the minimizing problem, so that the constraint is enforced only in the limit. We extend this result to the convexlike case. Moreover, we obtain a necessary condition for optimality for minimizing problems whose objective function and constraint mapping have convex Gateaux derivative.
本文言語 | English |
---|---|
ページ(範囲) | 179-189 |
ページ数 | 11 |
ジャーナル | Journal of Optimization Theory and Applications |
巻 | 38 |
号 | 2 |
DOI | |
出版ステータス | Published - 1982 10月 |
外部発表 | はい |
ASJC Scopus subject areas
- 経営科学およびオペレーションズ リサーチ
- 制御と最適化
- 応用数学