摘要
A trust region algorithm is proposed for solving bilevel programming problems where the lower level programming problem is a strongly convex programming problem with linear constraints. This algorithm is based on a trust region algorithm for nonsmooth unconstrained optimization problems, and its global convergence is also proved.
A trust region algorithm is proposed for solving bilevel programming problems where the lower lwel programming problem is a strongly convex programming problem with linear constraints. This algorithm is based on a trust region algorithm for nonsmooth unconstrained optimization problems, and its global convergence is also proved.
基金
theNationalNaturalScienceFoundationofChina (GrantNo .197310 0 1)andtheManagement,DecisionandInformationSystemLab,ChineseAcademyofSciences