Cargando…
New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
In this paper, we consider a sufficiently broad class of non-linear mathematical programs with disjunctive constraints, which, e.g. include mathematical programs with complemetarity/vanishing constraints. We present an extension of the concept of [Image: see text] -stationarity which can be easily c...
Autores principales: | Benko, Matúš, Gfrerer, Helmut |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Taylor & Francis
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5761710/ https://www.ncbi.nlm.nih.gov/pubmed/29375237 http://dx.doi.org/10.1080/02331934.2017.1387547 |
Ejemplares similares
-
An SQP method for mathematical programs with vanishing constraints with strong convergence properties
por: Benko, Matúš, et al.
Publicado: (2017) -
Disjunctive programming
por: Balas, Egon
Publicado: (2018) -
Coupling, stationarity, and regeneration /
por: Thorisson, Hermann
Publicado: (2000) -
Stationarity and Convergence in Reduce-or-Retreat Minimization
por: Levy, Adam B
Publicado: (2012) -
Rainfall statistics, stationarity, and climate change
por: Sun, Fubao, et al.
Publicado: (2018)