Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
From MaRDI portal
Publication:4995065
Recommendations
- Computational linear bilevel optimization
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A smoothing heuristic for a bilevel pricing problem
- Double penalty method for bilevel optimization problems
- A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results
Cites work
- A bilevel mixed-integer program for critical infrastructure protection planning
- A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- A class of algorithms for mixed-integer bilevel min-max optimization
- A dynamic reformulation heuristic for generalized interdiction problems
- A genetic algorithm for the multidimensional knapsack problem
- A multilevel model of the European entry-exit gas market
- A new general-purpose algorithm for mixed-integer bilevel linear programs
- A note on a penalty function approach for solving bilevel linear programs
- A Representation and Economic Interpretation of a Two-Level Programming Problem
- A simple algorithm for the-linear bilevel programming problem
- A smoothing heuristic for a bilevel pricing problem
- A solution method for the linear static Stackelberg problem using penalty functions
- A study on the use of heuristics to solve a bilevel programming problem
- An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
- Benchmarking optimization software with performance profiles.
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Bilevel knapsack with interdiction constraints
- Bilevel programming and price setting problems
- Bilevel programming and the separation problem
- Bilevel programming problems. Theory, algorithms and applications to energy networks
- Descent approaches for quadratic bilevel programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
- Foundations of bilevel programming
- Global optimization of multilevel electricity market models including network design and graph partitioning
- scientific article; zbMATH DE number 4191395 (Why is no real title available?)
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 7005721 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Intersection cuts for bilevel optimization
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Linear bilevel problems: genericity results and an efficient method for computing local minima
- Linear programming. Foundations and extensions
- Metaheuristics for bi-level optimization
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Nonconvex equilibrium models for gas market analysis: failure of standard techniques and alternative modeling approaches
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- Some properties of the bilevel programming problem
- Technical note -- There's no free lunch: on the hardness of choosing a correct big-M in bilevel optimization
- The EU regulation on cross-border trade of electricity: a two-stage equilibrium model
- The Mixed Integer Linear Bilevel Programming Problem
- The polynomial hierarchy and a simple model for competitive analysis
- Transmission and generation investment in electricity markets: the effects of market splitting and network fee regimes
- Using EPECs to Model Bilevel Games in Restructured Electricity Markets with Locational Prices
Cited in
(15)- Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
- Outer approximation for global optimization of mixed-integer quadratic bilevel problems
- A decomposition heuristic for mixed-integer supply chain problems
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
- Solving linear multiplicative programs via branch-and-bound: a computational experience
- Why there is no need to use a big-M in linear bilevel optimization: a computational study of two ready-to-use approaches
- A survey on mixed-integer programming techniques in bilevel optimization
- Extended mean-conditional value-at-risk portfolio optimization with PADM and conditional scenario reduction technique
- A penalty decomposition algorithm for the extended mean-variance-CVaR portfolio optimization problem
- Computational linear bilevel optimization
- A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results
- Componentwise Dinkelbach algorithm for nonlinear fractional optimization problems
- Mixed-integer bilevel optimization with nonconvex quadratic lower-level problems: complexity and a solution method
- Alternating direction method and deep learning for discrete control with storage
- Computing weak counterfactual explanations for linear optimization: a new class of bilevel models and a tailored penalty alternating direction method
This page was built for publication: Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995065)
