Exact and inexact penalty methods for the generalized bilevel programming problem
From MaRDI portal
Recommendations
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- Exact penalty method for the nonlinear bilevel programming problem
- An objective penalty function of bilevel programming
- An exact penalty function method for solving a class of nonlinear bilevel programs
- Combining approximation and exact penalty in hierarchical programming
Cites work
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- A note on a globally convergent Newton method for solving monotone variational inequalities
- A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
- A solution method for the linear static Stackelberg problem using penalty functions
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- Double penalty method for bilevel optimization problems
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- scientific article; zbMATH DE number 193559 (Why is no real title available?)
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- Sensitivity Analysis for Variational Inequalities
- The gap function of a convex program
- The steepest descent direction for the nonlinear bilevel programming problem
- The Theory of Max-Min, with Applications
Cited in
(38)- A natural gas cash-out problem: a bilevel programming framework and a penalty function method
- Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
- Bilevel and multilevel programming: A bibliography review
- A trust region algorithm for nonlinear bilevel programming
- Bilevel programming for generating discrete representations in multiobjective optimization
- On penalty method for equilibrium problems in lexicographic order
- A penalized method for multivariate concave least squares with application to productivity analysis
- Joint optimization for area traffic control and network flow
- A homotopy method for solving bilevel programming problem
- Stochastic mathematical programs with equilibrium constraints
- An objective penalty method for optimistic bilevel programming problems
- On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
- A globally convergent algorithm for transportation continuous network design problem
- Model and extended Kuhn-Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation
- A general MPCC model and its solution algorithm for continuous network design problem
- An overview of bilevel optimization
- Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches
- scientific article; zbMATH DE number 6672398 (Why is no real title available?)
- Exact penalty method for the nonlinear bilevel programming problem
- Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms
- On penalty and gap function methods for bilevel equilibrium problems
- Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
- Natural gas bilevel cash-out problem: convergence of a penalty function method
- An objective penalty function of bilevel programming
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- A quadratic objective penalty function for bilevel programming
- Monotonicity of optimal contracts without the first-order approach
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Combining approximation and exact penalty in hierarchical programming
- Exact penalty functions for convex bilevel programming problems.
- Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas
- A novel approach to solve multi-objective fuzzy stochastic bilevel programming using genetic algorithm
- Generalized variational inequalities with fuzzy relation
- A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints
- Solving stochastic transportation network protection problems using the progressive hedging-based method
- A descent framework for linked signal system with network flows
This page was built for publication: Exact and inexact penalty methods for the generalized bilevel programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814788)
