A variational principle for problems with functional constraints

被引：0
|
作者：
Ioffe, AD [1 ]
Lucchetti, RE
Revalski, JP
机构：
[1] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel
[2] Politecn Milan, Dept Math, I-22100 Como, Italy
[3] Bulgarian Acad Sci, Inst Math, BU-1113 Sofia, Bulgaria
来源：
SIAM JOURNAL ON OPTIMIZATION | 2001年 / 12卷 / 02期
关键词：
variational principle; well-posed optimization problem; mathematical programming; control problems; genericity; Baire category;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we show that in several important classes of optimization problems, like mathematical programming with k-smooth data, quadratic programming in a Hilbert space, convex programming in a Banach space, semi-infinite programming, and optimal control of linear systems with quadratic cost, most of the problems ( in the Baire category sense) are well-posed. This is derived from a general variational principle for problems with functional constraints.
引用
收藏
页码：461 / 478
页数：18
相关论文
共 50 条
12345