期刊
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
卷 49, 期 1, 页码 1-15出版社
SPRINGER
DOI: 10.1007/s10589-009-9295-9
关键词
Bilevel programming; Nonsmooth optimization; Solution algorithm; Direct search algorithm; Clarke stationary solution
资金
- DAAD (Deutscher Akademischer Austausch Dienst)
In this paper, we study the application of a class of direct search methods to bilevel programming with convex lower level problems with strongly stable optimal solutions. In those methods, directions of descent in each iterations are selected within a finite set of directions. To guarantee the existence of such a finite set, we investigate the relation between the aperture of a descent cone at a non stationary point and the vector density of a finite set of directions. It is shown that the direct search method converges to a Clarke stationary point of the bilevel programming problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据