Boundedness of a type of iterative sequences in two-dimensional quadratic programming (Q2260662)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Boundedness of a type of iterative sequences in two-dimensional quadratic programming |
scientific article |
Statements
Boundedness of a type of iterative sequences in two-dimensional quadratic programming (English)
0 references
11 March 2015
0 references
An open question about the boundedness of DCA (difference-of-convex functions algorithms) sequences produced by the projection DC decomposition algorithm is proposed in Conjecture 1 of \textit{H. A. Le Thi} et al. [J. Glob. Optim. 49, No. 3, 481--495 (2011; Zbl 1213.90189)]. In this paper, the author solve the part of open question in the special case of two-dimensional quadratic programs, without any additional assumption on the data sets.
0 references
quadratic programming
0 references
DC algorithm
0 references
DCA sequence
0 references
convergence
0 references
boundedness
0 references
difference-of-convex functions algorithms
0 references
0 references
0 references
