A smoothing Levenberg–Marquardt algorithm for semi-infinite programming
Ping Jin (),
Chen Ling () and
Huifei Shen ()
Computational Optimization and Applications, 2015, vol. 60, issue 3, 675-695
Abstract:
In this paper, we present a smoothing Levenberg–Marquardt algorithm for the solution of the semi-infinite programming (SIP) problem. We first reformulate the KKT system of SIP problem into a system of constrained nonsmooth equations. Then we solve this system by a smoothing Levenberg–Marquardt algorithm. The feasibility is ensured via the aggregated constraint, and at each iteration of the presented algorithm only a quadratic programming has to be solved. Global and local superlinear convergence of this algorithm is established under a local error bound condition, which is much weaker than the nonsingularity condition. Preliminary numerical results are reported. Copyright Springer Science+Business Media New York 2015
Keywords: Semi-infinite programming (SIP) problem; KKT system; Nonsmooth equations; Smoothing Levenberg–Marquardt algorithm; Convergence; 49M15; 49M37; 65K15; 90C30; 90C46 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-014-9698-0 (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:60:y:2015:i:3:p:675-695
Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589
DOI: 10.1007/s10589-014-9698-0
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 ().