The Algorithms Study of a Class of No-linear Bilevel Convex Programming

Zou La-ying · 2009

In this paper,the algorithms for a class of no-linear bilevel convex programming was studied.First,transformed the model by the K-T conditions and the penalty function,then got the solution by Frank-Wolfe algorithms.

Read the paper · More papers on PaperTik