Stable exponential-penalty algorithm with superlinear convergence |
| |
Authors: | R. Cominetti J. P. Dussault |
| |
Affiliation: | (1) Departamento de Ingeniería Matemática, Universidad de Chile, Santiago, Chile;(2) Département de Mathématiques et Informatique, Université de Sherbrooke, Sherbrooke, Québec, Canada |
| |
Abstract: | A renewed interest in penalty algorithms for solving mathematical programming problems has been motivated by some recent techniques which eliminate the ill-conditioning caused by the convergence to zero of the penalty parameter. These techniques are based on a good identification of the active set of constrainst at the optimum. In this sense, interior penalty methods to be more efficient than exterior ones, but their drawback lies in the need of an interior starting point. We propose in this paper an exponential penalty function which does not need interior starting points, but whose ultimate behavior is just like an interior penalty method. A superlinearly convergent algorithm based on the exponential penalty function is proposed.This research was partially supported by FONDECYT Grant 90-0945, DTI Grant E.3101-9012, and NSERC Grant OGP0005491. |
| |
Keywords: | Penalty algorithms exponential penalty function |
本文献已被 SpringerLink 等数据库收录! |
|