A method of feasible directions using function approximations, with applications to min max problems. (English) Zbl 0253.90046


90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
Full Text: DOI


[1] Zontendijk, G, Methods of feasible directions, (1960), Elsevier Amsterdam
[2] Zoukhovitzkii, S.I; Polyak, R.A; Primak, M.E, An algorithm for solution of convex programming problems, Dan ussr, 153, 991-1000, (1963)
[3] Topkis, D.M; Veinott, A, On the convergence of some feasible directions algorithms for nonlinear programming, J. SIAM control, 5, 268-279, (1967) · Zbl 0158.18805
[4] Polak, E, Of the convergence of optimization algorithms, Rev. franc. inform. recherche operat., 16, 17-34, (1969) · Zbl 0174.47906
[5] Frank, M; Wolfe, P, An algorithm for quadratic programming, Naval res. logistics quart., 3, 95-110, (1956)
[6] Rosen, J.B; Rosen, J.B, The gradient projection method for nonlinear programming, J. SIAM, J. SIAM, 9, 514-532, (1961) · Zbl 0231.90048
[7] Huard, P, The method of centers, () · Zbl 0253.90049
[8] Polak, E, On the implementation of conceptual algorithms, () · Zbl 0228.90051
[9] Meyer, G; Polak, E, Abstract models for the synthesis of optimization algorithms, () · Zbl 0209.16704
[10] Polak, E, Computational methods in optimization: A unified approach, (1971), Academic Press New York
[11] Armijo, L, Minimization of functions having Lipschitz continuous first partial derviatives, Pacific J. math., 16, 1-3, (1966) · Zbl 0202.46105
[12] Danskin, J, The theory of MAX-MIN, (1967), Springer-Verlag Berlin · Zbl 0154.20009
[13] Klessig, R; Polak, E, A method of feasible directions using function approximations with applications to MIN MAX problems, () · Zbl 0253.90046
[14] Klessig, R, Implementation of conceptual algorithms, () · Zbl 0253.90048
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.