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

2016 ◽  
Vol 32 (1) ◽  
pp. 69-85 ◽  
Author(s):  
Zhichuan Zhu ◽  
Bo Yu
2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Zhichuan Zhu ◽  
Yonghong Yao ◽  
Mihai Postolache

Abstract To design a quadratic spline contractual function in the case of discretely unknown nodes, a modified constraint shifting homotopy algorithm for solving principal–agent problems is constructed in the paper. Then the existence of globally convergent solution to KKT systems for the principal–agent problem with spline contractual function is proved under a much weaker condition. The proposed algorithm only requires that any initial point is in the shifted feasible set but not necessarily in the original feasible set.


2010 ◽  
Author(s):  
Mark Cecchini ◽  
Joseph Ecker ◽  
Michael Kupferschmid ◽  
Robert A. Leitch

2013 ◽  
Vol 230 (2) ◽  
pp. 364-373 ◽  
Author(s):  
Mark Cecchini ◽  
Joseph Ecker ◽  
Michael Kupferschmid ◽  
Robert Leitch

2002 ◽  
Author(s):  
William P. Bottom ◽  
James Holloway ◽  
Gary J. Miller ◽  
Alexandra Mislin ◽  
Andrew Whitford

Sign in / Sign up

Export Citation Format

Share Document