A Review of Numerical Methods for Semi-Infinite Optimization
暂无分享,去创建一个
[1] Ludwig J. Cromme,et al. Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen , 1975 .
[2] Konrad Oettershagen. Ein superlinear konvergenter Algorithmus zur Lösung semi-infiniter Optimierungsprobleme , 1982 .
[3] K. Madsen. An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations , 1975 .
[4] W. van Honstede. An approximation method for semi-infinite problems , 1979 .
[5] A. A. Goldstein,et al. Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.
[6] R. P. Hettich,et al. Semi-infinite programming: Conditions of optimality and applications , 1978 .
[7] R. Hettich,et al. Superlinear konvergente Verfahren für semi-infinite Optimierungsprobleme im stark eindeutigen Fall , 1980 .
[8] G. Zoutendijk,et al. Mathematical Programming Methods , 1976 .
[9] R. Hettich,et al. On quadratically convergent methods for semi-infinite programming , 1979 .
[10] Stephen M. Robinson,et al. Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..
[11] E. Stiefel. Note on Jordan elimination, linear programming and Tchebycheff approximation , 1960 .
[12] G. Alexits. Approximation theory , 1983 .
[13] Sven-Åke Gustafson,et al. On the Computational Solution of a Class of Generalized Moment Problems , 1970 .
[14] H.-J. Töpfer,et al. Tschebyscheff-Approximation und Austauschverfahren bei Nicht Erfüllter Haarscher Bedingung , 1967 .
[15] G. A. Watson,et al. Numerical Experiments with Globally Convergent Methods for Semi-Infinite Programming Problems , 1983 .
[16] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .
[17] G. A. Watson,et al. A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation , 1975 .
[18] C. Chui,et al. Approximation Theory II , 1976 .
[19] G. Meinardus. Approximation von Funktionen und ihre numerische Behandlung , 1964 .
[20] E. Stiefel,et al. Über diskrete und lineare Tschebyscheff-Approximationen , 1959, Numerische Mathematik.
[21] R. Hettich,et al. A newton-method for nonlinear Chebyshev approximation , 1976 .
[22] Eugen Schäfer,et al. Ein Konstruktionsverfahren bei allgemeiner linearer Approximation , 1971 .
[23] P. R. Gribik,et al. A central-cutting-plane algorithm for semi-infinite programming problems , 1979 .
[24] Rainer Hettich,et al. Numerische Methoden der Approximation und semi-infiniten Optimierung , 1982 .
[25] Martin H. Gutknecht. Ein Abstiegsverfahren Fuer Nicht-Diskrete Tschebyscheff-Approximationsprobleme , 1978 .
[26] Klaus Roleff,et al. A stable multiple exchange algorithm for linear sip , 1979 .
[27] Jack Elzinga,et al. A central cutting plane algorithm for the convex programming problem , 1975, Math. Program..
[28] G. Alistair Watson,et al. An Algorithm for Minimax Approximation in the Nonlinear Case , 1969, Comput. J..