Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
