An active set feasible method for large-scale minimization problems with bound constraints

M. Santis (), G. Pillo () and S. Lucidi ()

Computational Optimization and Applications, 2012, vol. 53, issue 2, 395-423

Abstract: We are concerned with the solution of the bound constrained minimization problem {minf(x), l≤x≤u}. For the solution of this problem we propose an active set method that combines ideas from projected and nonmonotone Newton-type methods. It is based on an iteration of the form x k+1 =[x k +α k d k ] ♯ , where α k is the steplength, d k is the search direction and [⋅] ♯ is the projection operator on the set [l,u]. At each iteration a new formula to estimate the active set is first employed. Then the components $d_{N}^{k}$ of d k corresponding to the free variables are determined by a truncated Newton method, and the components $d_{A}^{k}$ of d k corresponding to the active variables are computed by a Barzilai-Borwein gradient method. The steplength α k is computed by an adaptation of the nonmonotone stabilization technique proposed in Grippo et al. (Numer. Math. 59:779–805, 1991 ). The method is a feasible one, since it maintains feasibility of the iterates x k , and is well suited for large-scale problems, since it uses matrix-vector products only in the truncated Newton method for computing $d_{N}^{k}$ . We prove the convergence of the method, with superlinear rate under usual additional assumptions. An extensive numerical experimentation performed on an algorithmic implementation shows that the algorithm compares favorably with other widely used codes for bound constrained problems. Copyright Springer Science+Business Media New York 2012

Keywords: Bound constrained minimization problems; Large-scale minimization problems; Active set methods; Projected Newton-type methods; Nonmonotone Newton-type methods; Barzilai-Borwein gradient methods (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9506-7 (text/html)
Access to full text is restricted to subscribers.

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:coopap:v:53:y:2012:i:2:p:395-423

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-012-9506-7

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

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