Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming

Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming

Abstract
In this paper, a constraint set swelling homotopy (CSSH) algorithm for solving the single-level non-convex programming problem with designing piecewise linear contractual function which is equivalent to the principal-agent model with integral operator is proposed, and the existence and global convergence is proven under some mild conditions. As a comparison, a piecewise constant contract is also designed for solving the single-level non-convex programming problem with the corresponding discrete distributions. And some numerical tests are done by the proposed homotopy algorithm as well as by using fmincon in Matlab, LOQO and MINOS. The numerical results show that the CSSH algorithm is robust, feasible and effective.
World network
World network

Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming

Be the first to comment

Leave a Reply

Tu dirección de correo no será publicada.


*


Google Analytics