An interior point technique for solving bilevel programming problems
From MaRDI portal
Publication:402214
DOI10.1007/S11081-012-9192-4zbMATH Open1294.90062OpenAlexW2076535620MaRDI QIDQ402214FDOQ402214
Authors: José Herskovits, Mario Tanaka Filho, A. Leontiev 
Publication date: 27 August 2014
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-012-9192-4
Recommendations
- scientific article; zbMATH DE number 1783875
- Solving bilevel programming problem by a non-interior point homotopy method
- A method for solving bilevel linear programming problems
- A homotopy method for solving bilevel programming problem
- An interior point method for linear programming
- scientific article; zbMATH DE number 4031392
- An interior-point method for semi-infinite programming problems
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- scientific article; zbMATH DE number 108319
- A novel approach to bilevel nonlinear programming
Cites Work
- Bilevel and multilevel programming: A bibliography review
- Foundations of bilevel programming
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Title not available (Why is that?)
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- Mathematical Programs with Equilibrium Constraints
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Engineering and Economic Applications of Complementarity Problems
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Feasible direction interior-point technique for nonlinear optimization
- Optimality conditions for the bilevel programming problem
- Generating quadratic bilevel programming test problems
- Title not available (Why is that?)
- Descent approaches for quadratic bilevel programming
- A solution method for the static constrained Stackelberg problem via penalty method
- Title not available (Why is that?)
- Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
- The steepest descent direction for the nonlinear bilevel programming problem
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
Cited In (12)
- On the solution of convex bilevel optimization problems
- Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization
- An inexact-restoration method for nonlinear bilevel programming problems
- Smoothing and regularization strategies for optimization of hybrid dynamic systems
- Solving bilevel programming problem by a non-interior point homotopy method
- Title not available (Why is that?)
- Derivative evaluation and computational experience with large bilevel mathematical programs
- Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers
- Bilevel optimization: theory, algorithms, applications and a bibliography
- On bilevel programming. I: General nonlinear cases
- A feasible direction algorithm for nonlinear second-order cone programs
- Title not available (Why is that?)
Uses Software
This page was built for publication: An interior point technique for solving bilevel programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402214)
