Local Feasible QP-Free Algorithms for the Constrained Minimization of SC1 Functions
F. Facchinei and
C. Lazzari
Additional contact information
F. Facchinei: Università di Roma–La Sapienza
C. Lazzari: Istituto di Analisi dei Sistemi ed Informatica, CNR
Journal of Optimization Theory and Applications, 2003, vol. 119, issue 2, No 4, 316 pages
Abstract:
Abstract We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.
Keywords: Constrained optimization; feasible algorithms; SC1 functions; superlinear convergence; strict complementarity; quasi-Newton methods (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1023/B:JOTA.0000005447.36961.29 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:119:y:2003:i:2:d:10.1023_b:jota.0000005447.36961.29
Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2
DOI: 10.1023/B:JOTA.0000005447.36961.29
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 ().