## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories
✦ LIBER ✦
A nonsmooth Levenberg–Marquardt method for solving semi-infinite programming problems
✍ Scribed by Cheng Ma; Changyu Wang
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 530 KB
- Volume
- 230
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
✦ Synopsis
this paper, we first transform the semi-infinite programming problem into the KKT system by the techniques in [D.H.
📜 SIMILAR VOLUMES
Optimality conditions for convex semi-in
✍
A. Ben-Tal; L. Kerzner; S. Zlobec
📂
Article
📅
1980
🏛
John Wiley and Sons
🌐
English
⚖ 923 KB
JavaFit: A platform independent program
✍
A.W. Robinson
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 567 KB
The JavaFit program is a package for carrying out interactive nonlinear least-squares fitting to determine the parameters of physical models from experimental data. It has been conceived as a platform independent package aimed at the relatively modest computational needs of spectroscopists, where it
A homotopy method for solving bilevel pr
✍
Dao Li Zhu; Qing Xu; Zhenghua Lin
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 234 KB
A quantitative method for solving proble
✍
N.P. Naumov
📂
Article
📅
1971
🏛
Elsevier Science
⚖ 804 KB
A semi-infinite programming algorithm fo
✍
Xiaojiao Tong; Chen Ling; Liqun Qi
📂
Article
📅
2008
🏛
Elsevier Science
🌐
English
⚖ 195 KB
A vector majorization method for solving
✍
C.-T. Pan
📂
Article
📅
1989
🏛
Elsevier Science
🌐
English
⚖ 425 KB