On computational search for optimistic solutions in bilevel problems

DOI10.1007/s10898-009-9514-zzbMath1202.90219OpenAlexW2070616848MaRDI QIDQ1959241

Anton Valentinovich Malyshev, Andrey Vasil'evich Orlov, Alexander S. Strekalovsky

Publication date: 6 October 2010

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

Full work available at URL: https://doi.org/10.1007/s10898-009-9514-z

zbMATH Keywords

local searchcomputational simulationglobal search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Modern methods for solving nonconvex optimal control problems ⋮ On local search in d.c. optimization problems ⋮ Oligopolistic banking sector of Mongolia and polymatrix games of three players ⋮ An intelligent management system for the development of a regional transport logistics infrastructure ⋮ On numerical solving the spherical separability problem ⋮ Bilevel stochastic linear programming problems with quantile criterion ⋮ Global search in a noncovex optimal control problem ⋮ Quadratic Support Functions in Quadratic Bilevel Problems ⋮ Efficiently solving linear bilevel programming problems using off-the-shelf optimization software ⋮ A novel penalty function method for semivectorial bilevel programming problem ⋮ On computational search for Nash equilibrium in hexamatrix games ⋮ A Cutting Plane Approach for Solving Linear Bilevel Programming Problems ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ Global Search for Bilevel Optimization with Quadratic Data ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game

Cites Work

• Unnamed Item
• Unnamed Item
• Convex two-level optimization
• Practical bilevel optimization. Algorithms and applications
• Extremal problems with d.c.-contraints.
• A global optimization method for solving convex quadratic bilevel programming problems
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Foundations of bilevel programming
• An overview of bilevel optimization
• A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
• Generating Linear and Linear-Quadratic Bilevel Programming Problems
• Numerical solution of bilinear programming problems
• Generating quadratic bilevel programming test problems
• Local search in problems with nonconvex constraints
• Bilevel Programming
• Filled functions for unconstrained global optimization.