Pathfollowing for Parametric Mathematical Programs with Complementarity Constraints

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F23%3A00365966" target="_blank" >RIV/68407700:21230/23:00365966 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/s11081-023-09794-z" target="_blank" >https://doi.org/10.1007/s11081-023-09794-z</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11081-023-09794-z" target="_blank" >10.1007/s11081-023-09794-z</a>

Result language
angličtina
Original language name
Pathfollowing for Parametric Mathematical Programs with Complementarity Constraints
Original language description
In this paper we study procedures for pathfollowing parametric mathematical programs with complementarity constraints. We present two algorithms, one based on the penalty approach for solving standalone MPCCs, and one based on tracing active set bifurcations arising from doubly-active complementarity constraints. We demonstrate the performance of these two approaches on a variety of examples with different types of stationary points and also a simple engineering problem with phase changes.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2023
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)