Exact and inexact penalty methods for the generalized bilevel programming problem
From MaRDI portal
Publication:1814788
DOI10.1007/BF02592209zbMath0855.90120MaRDI QIDQ1814788
Publication date: 12 January 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
descent methodsmonotone variational inequalityhierarchical systemgeneralized bilevel programsexactness of a certain penalty functionstrong necessary optimality conditions
Related Items (34)
Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints ⋮ A homotopy method for solving bilevel programming problem ⋮ Bilevel and multilevel programming: A bibliography review ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ An objective penalty method for optimistic bilevel programming problems ⋮ Optimization-simulation model for planning supply transport to large infrastructure public works located in congested urban areas ⋮ On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty ⋮ Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints ⋮ Natural gas bilevel cash-out problem: convergence of a penalty function method ⋮ A novel approach to solve multi-objective fuzzy stochastic bilevel programming using genetic algorithm ⋮ An objective penalty function of bilevel programming ⋮ Stochastic mathematical programs with equilibrium constraints ⋮ A globally convergent algorithm for transportation continuous network design problem ⋮ A quadratic objective penalty function for bilevel programming ⋮ Model and extended Kuhn-Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation ⋮ On penalty method for equilibrium problems in lexicographic order ⋮ Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms ⋮ A general MPCC model and its solution algorithm for continuous network design problem ⋮ Exact penalty method for the nonlinear bilevel programming problem ⋮ A penalized method for multivariate concave least squares with application to productivity analysis ⋮ An overview of bilevel optimization ⋮ Generalized variational inequalities with fuzzy relation ⋮ Solving stochastic transportation network protection problems using the progressive hedging-based method ⋮ A globally convergent approximately active search algorithm for solving mathematical programs with linear complementarity constraints ⋮ Resolution method for mixed integer bi-level linear problems based on decomposition technique ⋮ Joint optimization for area traffic control and network flow ⋮ A descent framework for linked signal system with network flows ⋮ Exact penalty functions for convex bilevel programming problems. ⋮ Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches ⋮ Monotonicity of Optimal Contracts Without the First-Order Approach ⋮ 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 Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ A trust region algorithm for nonlinear bilevel programming
Cites Work
- Unnamed Item
- A note on a globally convergent Newton method for solving monotone variational inequalities
- The gap function of a convex program
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Double penalty method for bilevel optimization problems
- The steepest descent direction for the nonlinear bilevel programming problem
- A hybrid tabu-ascent algorithm for the linear bilevel programming problem
- Sensitivity analysis based heuristic algorithms for mathematical programs with variational inequality constraints
- A Sequential Linear Programming Algorithm for Solving Monotone Variational Inequalities
- An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
- Sensitivity Analysis for Variational Inequalities
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- The Theory of Max-Min, with Applications
- A solution method for the linear static Stackelberg problem using penalty functions
This page was built for publication: Exact and inexact penalty methods for the generalized bilevel programming problem
