On partial calmness for bilevel programming problem with a linear lower-level problem
Numerous publications are devoted to bilevel programming problems. Despite a seemingly simple statement these problems are considerably difficult for numerical solving, and a significant part of research in the field of bilevel programming is devoted to identifying particular subsets of problems tha...
Saved in:
| Main Authors: | D. E. Berezhnov, L. I. Minchenko |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-06-01
|
| Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Subjects: | |
| Online Access: | https://doklady.bsuir.by/jour/article/view/882 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Calculation of stationary points in linear bilevel programming problems
by: D. E. Berezhnov, et al.
Published: (2019-06-01) -
Group-Specific SVM With Bilevel Programming Methods for Parameter Optimization and Explainable AI in Urban Quality of Life Prediction
by: Gonzalo Rios-Vasquez, et al.
Published: (2025-01-01) -
Dimensional Synthesis of Parallel Robots Using Bilevel Optimization for Design Optimization and Resolution of Functional Redundancy
by: Moritz Schappler
Published: (2025-03-01) -
The robust isolated calmness of spectral norm regularized convex matrix optimization problems
by: Yin Ziran, et al.
Published: (2025-08-01) -
Maximizing Tax Revenue for Profit Maximizing Monopolist with the Cobb-Douglas Production Function and Linear Demand as a Bilevel Programming Problem
by: Zrinka Lukač, et al.
Published: (2025-04-01)