An Approximation Approach to Non‐strictly Convex Quadratic Semi‐infinite Programming

An Approximation Approach to Non‐strictly Convex Quadratic Semi‐infinite Programming

0.00 Avg rating0 Votes
Article ID: iaor20111374
Volume: 30
Issue: 2
Start Page Number: 195
End Page Number: 206
Publication Date: Nov 2004
Journal: Journal of Global Optimization
Authors: , ,
Keywords: Programming (semi-infinite)
Abstract:

We present in this paper a numerical method for solving non‐strictly‐convex quadratic semi‐infinite programming including linear semi‐infinite programming. The proposed method transforms the problem into a series of strictly convex quadratic semi‐infinite programming problems. Several convergence results and a numerical experiment are given.

Reviews

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