Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • M. Santis

    ()

  • G. Pillo

    ()

  • S. Lucidi

    ()

Registered author(s):

    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

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hdl.handle.net/10.1007/s10589-012-9506-7
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Computational Optimization and Applications.

    Volume (Year): 53 (2012)
    Issue (Month): 2 (October)
    Pages: 395-423

    as in new window
    Handle: RePEc:spr:coopap:v:53:y:2012:i:2:p:395-423

    Contact details of provider:
    Web page: http://www.springer.com/math/journal/10589

    Order Information:
    Web: http://link.springer.de/orders.htm

    Related research

    Keywords: Bound constrained minimization problems; Large-scale minimization problems; Active set methods; Projected Newton-type methods; Nonmonotone Newton-type methods; Barzilai-Borwein gradient methods;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:53:y:2012:i:2:p:395-423. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.