A new exact exponential penalty function method and nonconvex mathematical programming

A new exact penalty function method, called the l 1 exact exponential penalty function method, is introduced. In this approach, the so-called the exponential penalized optimization problem with the l 1 exact exponential penalty function is associated with the original optimization problem with both...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Applied mathematics and computation Ročník 217; číslo 15; s. 6652 - 6662
Hlavný autor: Antczak, Tadeusz
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier Inc 01.04.2011
Elsevier
Predmet:
ISSN:0096-3003, 1873-5649
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A new exact penalty function method, called the l 1 exact exponential penalty function method, is introduced. In this approach, the so-called the exponential penalized optimization problem with the l 1 exact exponential penalty function is associated with the original optimization problem with both inequality and equality constraints. The l 1 exact exponential penalty function method is used to solve nonconvex mathematical programming problems with r-invex functions (with respect to the same function η). The equivalence between sets of optimal solutions of the original mathematical programming problem and of its associated exponential penalized optimization problem is established under suitable r-invexity assumption. Also lower bounds on the penalty parameter are given, for which above these values, this result is true.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2011.01.051