Solving polyhedral d.c. optimization problems via concave minimization

The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of polyhedral d.c. optimization problems. This result is used to sho...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 78; číslo 1; s. 37 - 47
Hlavní autori:	vom Dahl, Simeon, Löhne, Andreas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY Springer US 01.09.2020 Springer Springer Nature B.V
Predmet:	Algorithms Computer Science D.c. programming Global optimization Linear vector optimization Mathematics Mathematics and Statistics Multi-objective linear programming Operations Research/Decision Theory Optimization Real Functions Global optimization D.c. programming 52B55 90C29 Linear vector optimization 90C26 Multi-objective linear programming
ISSN:	1573-2916, 0925-5001, 1573-2916
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!