A regularized penalty method for solving convex semi-infinite programs

A regularized penalty method for solving convex semi-infinite programs

0.00 Avg rating0 Votes
Article ID: iaor19942444
Country: Germany
Volume: 26
Start Page Number: 215
End Page Number: 228
Publication Date: Oct 1992
Journal: Optimization
Authors: ,
Keywords: semi-infinite programming
Abstract:

This paper is concerned with the stable solution of ill-posed convex semi-infinite problems on the base of their sequential approximation by finite dimensional convex problems on a sequence of grids. These auxiliary programs are constructed by using the iterative Prox-regularization and for solving each of them only one step of a penalty method is applied. A simple deletion procedure of inactive constraints is suggested. The choice of the control parameters secures the convergence of the methods and a linear convergence rate is obtained.

Reviews

Required fields are marked *. Your email address will not be published.