New extended SQP algorithms for nonsmooth difference programming with VI constraints, with global convergence via the Polyak-Łojasiewicz-Kurdyka property for semialgebraic functions.
SIAM Journal on Optimization 18, 556–572 (2007) 29
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Extended SQP Methods in Nonsmooth Difference Programming Applied to Problems with Variational Inequality Constraints
New extended SQP algorithms for nonsmooth difference programming with VI constraints, with global convergence via the Polyak-Łojasiewicz-Kurdyka property for semialgebraic functions.