Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
From MaRDI portal
Publication:5268891
Recommendations
- A modified homotopy method for solving the principal-agent bilevel programming problem
- Globally convergent homotopy method for designing piecewise linear deterministic contractual function
- A homotopy method for solving bilevel programming problem
- A method for solving principal-agent problems via the satisfactory degree of bilevel programming problem
- Computing optimal incentives via bilevel programming
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- A Constructive Proof of the Brouwer Fixed-Point Theorem and Computational Results
- A combined homotopy interior point method for general nonlinear programming problems
- A convergent process of price adjustment and global Newton methods
- Algorithm 652
- An Analysis of the Principal-Agent Problem
- Computing solutions to moral-hazard programs using the Dantzig-Wolfe decomposition algorithm
- Distributions for the first-order approach to principal-agent problems
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Foundations of bilevel programming
- Homotopy curve tracking in approximate interior point optimization
- Introduction to Numerical Continuation Methods
- Justifying the First-Order Approach to Principal-Agent Problems
- New necessary optimality conditions for bilevel programs by combining the MPEC and value function approaches
- On solving simple bilevel programs with a nonconvex lower level program
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- Optimal coordination mechanisms in generalized principal-agent problems
- The First-Order Approach to Multi-Signal Principal-Agent Problems
- The First-Order Approach to Principal-Agent Problems
- Theory of globally convergent probability-one homotopies for nonlinear programming
- Two New Conditions Supporting the First-Order Approach to Multisignal Principal-Agent Problems
Cited in
(12)- A modified infeasible homotopy algorithm for computing fixed point in general non-convex set
- Globally convergent homotopy method for designing piecewise linear deterministic contractual function
- A modified iterative algorithm for finding a common element in Hilbert space
- A homotopy method for solving bilevel programming problem
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- A modified homotopy method for solving the principal-agent bilevel programming problem
- A method for solving principal-agent problems via the satisfactory degree of bilevel programming problem
- Convergences for robust bilevel polynomial programmes with applications
- A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming
- Globally convergent method for designing twice spline contractual function
- Some inequality techniques in handling fixed point problems on unbounded sets via homotopy methods
- Dynamic constraint homotopy algorithm for solving a class of extremum problem of function
This page was built for publication: Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268891)
