A New Computational Approach for Solving Linear Bilevel Programs Based on Parameter-Free Disjunctive Decomposition
Linear bilevel programs (linear BLPs) have been widely used in computational mathematics and optimization in several applications. Single-level reformulation for linear BLPs replaces the lower-level linear program with its Karush-Kuhn-Tucker optimality conditions and linearizes the complementary slackness conditions using the big-M technique. Although the approach is straightforward, it requires finding the big-M whose computation is recently shown to be NP-hard. This paper presents a disjunctive-based decomposition algorithm which does not need finding the big-Ms whereas guaranteeing that obtained solution is optimal. Our experience shows promising performance of our algorithm.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Forecasting the Price-Response of a Pool of Buildings via Homothetic Inverse Optimization
This paper focuses on the day-ahead forecasting of the aggregate power of a pool of smart buildings equipped with thermostatically-controlled loads. We first propose the modeling of the aggregate behavior of its power tr…
Consistency analysis of bilevel data-driven learning in inverse problems
One fundamental problem when solving inverse problems is how to find regularization parameters. This article considers solving this problem using data-driven bilevel optimization, i.e. we consider the adaptive learning o…
Bilevel OptimizationDenoisingImage DenoisingLearning to Solve Constrained Bilevel Control Co-Design Problems
Learning to Optimize (L2O) is a subfield of machine learning (ML) in which ML models are trained to solve parametric optimization problems. The general goal is to learn a fast approximator of solutions to constrained opt…
Bilevel OptimizationBilevel optimization for learning hyperparameters: Application to solving PDEs and inverse problems with Gaussian processes
Methods for solving scientific computing and inference problems, such as kernel- and neural network-based approaches for partial differential equations (PDEs), inverse problems, and supervised learning tasks, depend cruc…
Hyperparameter OptimizationBilevel OptimizationGaussian ProcessesValue Function Based Difference-of-Convex Algorithm for Bilevel Hyperparameter Selection Problems
Gradient-based optimization methods for hyperparameter tuning guarantee theoretical convergence to stationary solutions when for fixed upper-level variable values, the lower level of the bilevel program is strongly conve…