Global solution of bilevel programs with a nonconvex inner program

DOI10.1007/s10898-007-9260-zzbMath1163.90700OpenAlexW2056831000MaRDI QIDQ1016068

Alexander Mitsos, Panayiotis Lemonidis, Paul I. Barton

Publication date: 4 May 2009

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9260-z

zbMATH Keywords

global optimization branch-and-bound nonconvex MPEC bilevel program

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

Multilevel decision-making: a survey, A non-convex non-smooth bi-level parameter learning for impulse and Gaussian noise mixture removing, On bilevel programs with a convex lower-level problem violating Slater's constraint qualification, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, A review of recent advances in global optimization, Towards global bilevel dynamic optimization, Bilevel programming for generating discrete representations in multiobjective optimization, Solving quality control problems with an algorithm for minimax programs with coupled constraints, A non-convex denoising model for impulse and Gaussian noise mixture removing using bi-level parameter identification, SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, Optimal deterministic algorithm generation, A bridge between bilevel programs and Nash games, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, An improved spatially controlled reaction-diffusion equation with a non-linear second order operator for image super-resolution, How to solve a design centering problem, A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs, The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets, On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory, Bilevel Polynomial Programs and Semidefinite Relaxation Methods, A lifting method for generalized semi-infinite programs based on lower level Wolfe duality, Recent advances in nonconvex semi-infinite programming: applications and algorithms, A survey on mixed-integer programming techniques in bilevel optimization, A bi-level multi-follower optimization model for R\&D project portfolio: an application to a pharmaceutical holding company, Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming, Bilevel optimization for joint scheduling of production and energy systems, On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level, Levenberg-Marquardt method and partial exact penalty parameter selection in bilevel optimization, Decision Rule Bounds for Two-Stage Stochastic Bilevel Programs, A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem, Global solution of nonlinear mixed-integer bilevel programs, On solving simple bilevel programs with a nonconvex lower level program, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results, Global optimization of generalized semi-infinite programs via restriction of the right hand side, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, Bilevel programming solution algorithms for optimal price-bidding of energy producers in multi-period day-ahead electricity markets with non-convexities, A mixed-integer bilevel programming approach for a competitive prioritized set covering problem, A semi-infinite programming based algorithm for determining T-optimum designs for model discrimination, On the computation of relaxed pessimistic solutions to MPECs, Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints, A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs, Gauss-Newton-type methods for bilevel optimization, A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem, Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems, A smoothing augmented Lagrangian method for solving simple bilevel programs, Global optimization of semi-infinite programs via restriction of the right-hand side, An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities, On convex lower-level black-box constraints in bilevel optimization with an application to gas market models with chance constraints, A robust approach to warped Gaussian process-constrained optimization, Global Search for Bilevel Optimization with Quadratic Data, MPEC Methods for Bilevel Optimization Problems, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game, On the solution of convex bilevel optimization problems

Uses Software

Cites Work