A note on the decomposition method for large-scale box constrained optimization

Farzane Fallahati and Masoud Allame

Applied Mathematics and Computation, 2015, vol. 265, issue C, 568-569

Abstract: In this paper, we investigate on the decomposition method that was presented by Yu and et al. [1]. We show a note about it.

Keywords: Box constrained optimization; Decomposition method; Working set identification; Large-scale; KKT-violating index; Lagrange method (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315006815
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:265:y:2015:i:c:p:568-569

DOI: 10.1016/j.amc.2015.05.057

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().