An interior-point l(subscript)1-penalty method for nonlinear optimization

ePubs

The open archive for STFC research publications

Persistent URL	http://purl.org/net/epubs/work/29800
Record Status	Checked
Record Id	29800
Title	An interior-point l(subscript)1-penalty method for nonlinear optimization
Contributors	N I M Gould, D Orban, PL Toint
Abstract	A mixed interior-point l(subscript)1-penalty function. A suitable decomposition of the penalty terms and embedding of the problem into a higher-dimensional setting leads to an equivalent, surprisingly regular, reformulation as a smooth penalty problem only involving inequality constraints. The resulting problem may then be tackled using interior-point techniques as finding a strictly feasible initial point is trivial. The reformulation relaxes the shape of the constraints, promoting larger steps and easing the non-linearity of the strictly feasible set in the neighbourhood of a solution. If finite multipliers exist, exactness of the penalty function eliminates the need to drive the corresponding penalty parameter to infinity. Global and fast local convergence of the proposed scheme are established and practical aspects of the method are discussed.
Organisation	CCLRC
Keywords
Funding Information
Related Research Object(s):
Licence Information:
Language	English (EN)

Type	Details	URI(s)	Local file(s)	Year
Report	RAL Technical Reports RAL-TR-2003-022. 2003.		raltr-2003022.pdf	2003