scholarly journals Globally convergent method for designing twice spline contractual function

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Zhichuan Zhu ◽  
Yonghong Yao ◽  
Mihai Postolache
Keyword(s):  
Initial Point ◽  
Principal Agent ◽  
Quadratic Spline ◽  
Feasible Set ◽  
Homotopy Algorithm ◽  
Kkt Systems ◽  
Globally Convergent ◽  
Principal Agent Problem ◽  
Convergent Method ◽  
Convergent Solution

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.

scholarly journals A globally convergent method for finding zeros of integer functions of finite order

2017 ◽  
pp. 115-128
Author(s):  
А.Н. Громов
Keyword(s):  
Finite Order ◽  
Logarithmic Derivative ◽  
Initial Point ◽  
Globally Convergent ◽  
Finite Set ◽  
Minimum Number ◽  
Convergent Method ◽  
Arbitrary Initial Point ◽  
Partial Fractions ◽  
Derivatives Of

Предложен метод отыскания нулей целых функций конечного порядка, который сходится к корню от произвольной начальной точки, т.е. является глобально сходящимся. Метод основан на представлении производных высшего порядка от логарифмической производной в виде суммы простейших дробей и сводит отыскание корня к выбору минимального числа из конечного множества. Даны оценки скорости сходимости. A method for finding zeros of integer functions of finite order is proposed. This method converges to a root starting from an arbitrary initial point and, hence, is globally convergent. The method is based on a representation of higher-order derivatives of the logarithmic derivative as a sum of partial fractions and reduces the finding of a root to the choice of the minimum number from a finite set. The rate of convergence is estimated.

scholarly journals Incentivizing by example and money

2020 ◽  
Author(s):  
Thomas Bauer ◽  
Franz Wirl
Keyword(s):  
Private Information ◽  
Financial Incentives ◽  
Role Models ◽  
Principal Agent ◽  
Principal Agent Problem ◽  
Reservation Utility

AbstractLeaders are role models that affect their employees’ efforts. The effect depends on how much an employee identifies with the “boss”. Since this degree of identification is private information of the employee, additional financial incentives must be provided. Therefore, we study a principal-agent problem in which the principal affects the agent’s effort by her own effort and by financial incentives. The resulting principal-agent problem has a few non-standard specifics such as: (i) bilateral externalities as the principal’s effort affects the agent and vice versa and (ii) endogenous reservation utility of the agent. Combined, this leads to non-trivial and interesting contracts.

Convexity of a discrete Carleman weighted objective functional in an inverse medium scattering problem

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Nguyen Trung Thành
Keyword(s):  
Finite Number ◽  
Scattering Problem ◽  
One Dimensional ◽  
Globally Convergent ◽  
Convergent Method ◽  
Inverse Medium ◽  
Inverse Medium Scattering ◽  
Objective Functional

AbstractWe investigate a globally convergent method for solving a one-dimensional inverse medium scattering problem using backscattering data at a finite number of frequencies. The proposed method is based on the minimization of a discrete Carleman weighted objective functional. The global convexity of this objective functional is proved.

Sign in / Sign up

Export Citation Format

Share Document