A penalty function method based on bilevel programming for solving inverse optimal value problems
From MaRDI portal
Publication:710987
DOI10.1016/J.AML.2009.09.007zbMATH Open1202.90242OpenAlexW2131140226MaRDI QIDQ710987FDOQ710987
Authors: D. Kharzeev 
Publication date: 25 October 2010
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2009.09.007
Recommendations
Cites Work
- Practical bilevel optimization. Algorithms and applications
- Exact Penalization and Necessary Optimality Conditions for Generalized Bilevel Programming Problems
- A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming
- Title not available (Why is that?)
- Inverse Optimization
- Calculating some inverse linear programming problems
- Descent approaches for quadratic bilevel programming
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- The inverse optimal value problem
- A penalty function method for solving inverse optimal value problem
Cited In (7)
- Inequalities for the medians and vertex distances of two \(n\)-simplices with applications
- A penalty function method for solving inverse optimal value problem
- Solving inverse optimal control problems via value functions to global optimality
- An application of bilevel programming in inverse optimal value problem
- A cutting plane approach for solving linear bilevel programming problems
- Finding global solutions of some inverse optimal control problems using penalization and semismooth Newton methods
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
This page was built for publication: A penalty function method based on bilevel programming for solving inverse optimal value problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q710987)
