An interior point technique for solving bilevel programming problems
From MaRDI portal
Publication:402214
DOI10.1007/s11081-012-9192-4zbMath1294.90062OpenAlexW2076535620MaRDI QIDQ402214
José Herskovits, Mario Tanaka Filho, Anatoli 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
Related Items
Smoothing and regularization strategies for optimization of hybrid dynamic systems ⋮ Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers ⋮ Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization ⋮ A feasible direction algorithm for nonlinear second-order cone programs ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Uses Software
Cites Work
- Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties
- Uniqueness results and algorithm for Stackelberg-Cournot-Nash equilibria
- Feasible direction interior-point technique for nonlinear optimization
- Descent approaches for quadratic bilevel programming
- Bilevel and multilevel programming: A bibliography review
- The steepest descent direction for the nonlinear bilevel programming problem
- Foundations of bilevel programming
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- A solution method for the static constrained Stackelberg problem via penalty method
- Optimality conditions for the bilevel programming problem
- Generating quadratic bilevel programming test problems
- Engineering and Economic Applications of Complementarity Problems
- Solving mathematical programs with complementarity constraints as nonlinear programs
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- 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
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
- Mathematical Programs with Equilibrium Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
