On solving difference of convex functions programs with linear complementarity constraints

We address a large class of Mathematical Programs with Linear Complementarity Constraints which minimizes a continuously differentiable DC function (Difference of Convex functions) on a set defined by linear constraints and linear complementarity constraints, named Difference of Convex functions pro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational optimization and applications Jg. 86; H. 1; S. 163 - 197
Hauptverfasser:	Le Thi, Hoai An, Nguyen, Thi Minh Tam, Dinh, Tao Pham
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2023 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithms Computer Science Convex analysis Convex and Discrete Geometry Eigenvalues Management Science Mathematical programming Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Penalty function Statistics Mathematical program with linear complementarity constraints Difference of convex functions algorithm Penalty function 90C30 Difference of convex functions programming 90C33 Difference of convex functions constraints 90C90 90C26
ISSN:	0926-6003, 1573-2894
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!