BDCA is generalized to linearly constrained DC programs; cluster points are KKT points and the sequence converges R-linearly for quadratic objectives.
Euro- pean J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Boosted DC Algorithm for linearly constrained DC programming
BDCA is generalized to linearly constrained DC programs; cluster points are KKT points and the sequence converges R-linearly for quadratic objectives.