Some outer approximation methods for semi-infinite optimization problems

[1]  A. A. Goldstein,et al.  Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

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

[3]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[4]  Arthur F. Veinott,et al.  The Supporting Hyperplane Method for Unimodal Programming , 1967, Oper. Res..

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

[6]  Donald M. Topkis.  Letter to the Editor - A Note on Cutting-Plane Methods Without Nested Constraint Sets , 1970, Oper. Res..

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

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

[9]  Kenneth O. Kortanek,et al.  Numerical treatment of a class of semi‐infinite programming problems , 1973 .

[10]  William W. Hogan,et al.  Applications of a general convergence theory for outer approximation algorithms , 1973, Math. Program..

[11]  Jack Elzinga,et al.  A central cutting plane algorithm for the convex programming problem , 1975, Math. Program..

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

[13]  S. C. Parikh.  Approximate cutting planes in nonlinear programming , 1976, Math. Program..

[14]  Gary A. Kochenberger,et al.  Computational aspects of cutting-plane algorithms for geometric programming problems , 1977, Math. Program..

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

[16]  P. R. Gribik,et al.  A central-cutting-plane algorithm for semi-infinite programming problems , 1979 .

[17]  Kenneth O. Kortanek,et al.  Semi-Infinite Programming and Applications , 1983, ISMP.

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

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

[20]  Rainer Hettich,et al.  A Review of Numerical Methods for Semi-Infinite Optimization , 1983 .

[21]  Masao Fukushima.  An Outer Approximation Algorithm for Solving General Convex Programs , 1983, Oper. Res..

[22]  M. Fukushima.  On the convergence of a class of outer approximation algorithms for convex programs , 1984 .

[23]  Rainer Hettich,et al.  An implementation of a discretization method for semi-infinite programming , 1986, Math. Program..

[24]  Masao Fukushima,et al.  A globally convergent SQP method for semi-infinite nonlinear optimization , 1988 .

[25]  R. Tichatschke,et al.  A cutting-plane method for quadratic semi infinite programming problems , 1988 .

[26]  A. Tits,et al.  A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design , 1989 .

[27]  Aimo A. Törn,et al.  Global Optimization , 1999, Science.

[28]  Peter Kosmol,et al.  Methoden zur numerischen Behandlung nichtlinearer Gleichungen und Optimierungsaufgaben , 1989 .

[29]  Rainer Hettich,et al.  A note on an implementation of a method for quadratic semi-infinite programming , 1990, Math. Program..

[30]  Rembert Reemtsen,et al.  Modifications of the first Remez algorithm , 1990 .

[31]  Discrete approximations of minimization problems. I. Theory , 1990 .

[32]  Reiner Horst,et al.  Deterministic methods in constrained global optimization: Some recent advances and new fields of application , 1990 .

[33]  Hui Hu,et al.  A one-phase algorithm for semi-infinite linear programming , 1990, Math. Program..

[34]  R. Reemtsen,et al.  Discretization methods for the solution of semi-infinite programming problems , 1991 .

[35]  Alexander Potchinkov,et al.  FIR filter design in the complex domain by a semi-infinite programming technique. I: The method , 1994 .