Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming

Hoang Ngoc Tuan ()
Additional contact information
Hoang Ngoc Tuan: Hanoi Pedagogical University

Journal of Optimization Theory and Applications, 2015, vol. 164, issue 1, No 12, 234-245

Abstract: Abstract We prove that any iterative sequence generated by the projection decomposition algorithm of Pham Dinh et al. (Optim Methods Softw 23:609–629, 2008) in quadratic programming is bounded, provided that the quadratic program in question is two-dimensional and solvable.

Keywords: Quadratic programming; DC algorithm; DCA sequence; Convergence; Boundedness; 65K05; 65K10; 90C20; 90C26; 90C30 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-014-0530-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:164:y:2015:i:1:d:10.1007_s10957-014-0530-x

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-014-0530-x

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().