论文信息 - A cutting-plane method for quadratic semi infinite programming problems

A cutting-plane method for quadratic semi infinite programming problems

A cutting plane algorithm for solving convex quadratic semi-infinite programming problems is presented. Nonbinding constraints can be dropped. Its arithmetic convergence rate is proved by taking into consideration the error of the approximate solution of the auxiliary problem to calculate the most violate constraint. An implementable variant of this method is described which is due to the adaptive discretization of the index set and its stability is shown. Computational experiments show the behaviour of the method.

R. Tichatschke | V. Nebeling

[1] Donald M. Topkis,et al. Cutting-Plane Methods without Nested Constraint Sets , 1970, Oper. Res..

[2] J. E. Falk,et al. Infinitely constrained optimization problems , 1976 .

[3] C. C. Gonzaga,et al. On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .

[4] K. C. Kapur. On cutoff optimization methods in infinite-dimensional spaces and applications , 1973 .

[5] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .

[6] Christian Großmann,et al. Strafmethoden und modifizierte Lagrangefunktionen in der nichtlinearen Optimierung , 1979 .

[7] B. Eaves,et al. Generalized Cutting Plane Algorithms , 1971 .

[8] Rainer Hettich,et al. Numerische Methoden der Approximation und semi-infiniten Optimierung , 1982 .

[9] W. Oettli. Solving Optimization Problems with many Constraints by a Sequence of Subproblems Containing only two Constraints , 1976 .

[10] D. M. Topkis. A cutting-plane algorithm with linear and geometric rates of convergence , 1982 .

[11] James W. Daniel,et al. Stability of the solution of definite quadratic programs , 1973, Math. Program..

[12] H. Schwetlick. Numerische Lösung nichtlinearer Gleichungen , 1978 .