A modified homotopy method for solving the principal-agent bilevel programming problem
type: Item
instance of: scholarly article
title: A modified homotopy method for solving the principal-agent bilevel programming problem
zbMATH Open document ID: 1409.91157
author: Zhichuan Zhu
author: Bo Yu
published in: Computational and Applied Mathematics
publication date: 2018-08-09T00:00:00Z
Mathematics Subject Classification ID: 91B40
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 14F99
zbMATH DE Number: 6915467
zbMATH Keywords: principal-agent model
zbMATH Keywords: piecewise linear contractual function
zbMATH Keywords: homotopy method
zbMATH Keywords: nonconvex programming
zbMATH Keywords: Simpson's rule
describes a project that uses: Matlab
describes a project that uses: HOMPACK
MaRDI profile type: Publication
full work available at URL: s40314-016-0361-5
OpenAlex ID: W2466817430
cites work: Introduction to Numerical Continuation Methods
cites work: An inexact-restoration method for nonlinear bilevel programming problems
cites work: An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization
cites work: Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
cites work: Two New Conditions Supporting the First-Order Approach to Multisignal Principal-Agent Problems
cites work: Q4860596
cites work: Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
cites work: An Analysis of the Principal-Agent Problem
cites work: Justifying the First-Order Approach to Principal-Agent Problems
cites work: A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
cites work: Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
cites work: Distributions for the first-order approach to principal-agent problems
cites work: A combined homotopy interior point method for general nonlinear programming problems
cites work: On solving simple bilevel programs with a nonconvex lower level program
cites work: A smoothing augmented Lagrangian method for solving simple bilevel programs
cites work: The First-Order Approach to Principal-Agent Problems
cites work: The Theory of Moral Hazard and Unobservable Behaviour: Part I
cites work: Optimal coordination mechanisms in generalized principal-agent problems
cites work: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
cites work: Q4275409
cites work: Q3051654
cites work: The First-Order Approach to Multi-Signal Principal-Agent Problems
cites work: A convergent process of price adjustment and global Newton methods
cites work: Algorithm 652
cites work: Q4906121
cites work: New Necessary Optimality Conditions for Bilevel Programs by Combining the MPEC and Value Function Approaches
cites work: Q5422996
DOI: 10.1007/S40314-016-0361-5
description: scientific article; zbMATH DE number 6915467