Skip to content
naulon

Not checkedNot checked for notices yet.

Globally convergent method for designing twice spline contractual function

Zhichuan Zhu, Yonghong Yao, Mihai Postolache

Journal of Inequalities and Applications · 2019

doi:10.1186/s13660-019-2243-z (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

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.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.