A Generalized Projetion Gradient Algorithm for Mathematical Programs with Complementary Constraints

Against the shortcomings that many existing algorithms for solving the standard smoothing nonlinear programming would fail if they were used directly to solve the mathematical programs with complementary constraints( MPCC). By using a complementarity function and the idea of smoothing approximation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. Conference series Jg. 2289; H. 1; S. 12019 - 12025
Hauptverfasser: Zhang, Cong, Sun, Limin, Xiao, Ya
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Bristol IOP Publishing 01.06.2022
Schlagworte:
Algorithms
Approximation
Mathematical analysis
Mathematical programming
Nonlinear programming
Physics
Smoothing
ISSN:1742-6588, 1742-6596
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Against the shortcomings that many existing algorithms for solving the standard smoothing nonlinear programming would fail if they were used directly to solve the mathematical programs with complementary constraints( MPCC). By using a complementarity function and the idea of smoothing approximation method, the MPCC problem was transformed into a smoothing nonlinear programming. Combined with the supermemory gradient idea, a generalized projection gradient algorithm is proposed and its global convergence is obtained.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2289/1/012019