On computational search for optimistic solutions in bilevel problems
type: Item
instance of: scholarly article
title: On computational search for optimistic solutions in bilevel problems
zbMATH Open document ID: 1202.90219
author: A. V. Malyshev
author: A. S. Strekalovskiĭ
author: Andrey Vasil'evich Orlov
published in: Journal of Global Optimization
publication date: 2010-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5796464
zbMATH Keywords: local search
zbMATH Keywords: global search
zbMATH Keywords: computational simulation
MaRDI profile type: Publication
full work available at URL: s10898-009-9514-z
OpenAlex ID: W2070616848
cites work: Practical bilevel optimization. Algorithms and applications
cites work: Foundations of bilevel programming
cites work: Bilevel Programming
cites work: An overview of bilevel optimization
cites work: A global optimization method for solving convex quadratic bilevel programming problems
cites work: Convex two-level optimization
cites work: Filled functions for unconstrained global optimization.
cites work: A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
cites work: Q3932576
cites work: Q3997222
cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms
cites work: Extremal problems with d.c.-contraints.
cites work: Local search in problems with nonconvex constraints
cites work: Numerical solution of bilinear programming problems
cites work: Generating Linear and Linear-Quadratic Bilevel Programming Problems
cites work: Generating quadratic bilevel programming test problems
DOI: 10.1007/S10898-009-9514-Z
description: scientific article; zbMATH DE number 5796464