A partitioned PSB method for partially separable unconstrained optimization problems

Huiping Cao and Lan Yao

Applied Mathematics and Computation, 2016, vol. 290, issue C, 164-177

Abstract: In this paper, we propose a partitioned PSB method for solving partially separable unconstrained optimization problems. By using a projection technique, we construct a sufficient descent direction. Under appropriate conditions, we show that the partitioned PSB method with projected direction is globally and superlinearly convergent for uniformly convex problems. In particular, the unit step length is accepted after finitely many iterations. Finally, some numerical results are presented, which show that the partitioned PSB method is effective and competitive.

Keywords: Partially separable optimization problems; Partitioned PSB method; Projected PSB method; Global convergence; Superlinear convergence (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300316303800
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:290:y:2016:i:c:p:164-177

DOI: 10.1016/j.amc.2016.06.009

Access Statistics for this article

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 ().