| [1] |
R. Aris, Discrete Dynamic Programming [Russian translation], Mir, Moscow (1969), 172 pp. |
| [2] |
M. D. Babich and V. V. Ivanov, ?Study of total error in minimization problems of functionals with constraints,? Ukrainsk. Matem. Zh.,21, No. 1, 3?14 (1969). |
| [3] |
R. Bellman, Dynamic Programming, Academic Press (1966). · Zbl 0201.47902 |
| [4] |
R. Bellman and S. Dreyfus, Applied Dynamic Programming, Princeton Univ. Press (1962). · Zbl 0106.34901 |
| [5] |
E. M. Berkovich and B. M. Budak, ?Influence of computational errors on convergence of gradient projection method,? in: Approximation Methods of Solving Optimal Control Problems and Particular Incorrect Inverse Problems [in Russian], Izd. Mosk. Univ., Moscow (1972), pp. 74?81. |
| [6] |
B. Birzak and B. N. Pshenichnyi, ?Minimization problems for discontinuous functions,? Kibernetika, No. 6, 53?57 (1966). |
| [7] |
É. P. Borisova, ?Solution of a linear programming problem with two-sided constraints using the iteration method,? Ékon. i Matem. Metody,7, No. 5, 773?774 (1971). |
| [8] |
A. Bryson and Yu-Chi Ho, Applied Optimal Control Theory. Optimization, Estimation, and Control, Halsted Press (1975). |
| [9] |
L. M. Brégman, ?Relaxation method of finding the common point of convex sets and its application towards solving complex programming problems,? Zh. Vychisl. Matem. i Matem. Fiz.,7, No. 3, 620?631 (1967). |
| [10] |
B. M. Budak and E. M. Berkovich, ?Approximation of extremal problems. I, II,? Zh. Vychisl. Matem. i Matem. Fiz.,11, No. 3, 580?596; No. 4, 870?884 (1971). |
| [11] |
B. M. Budak, E. M. Berkovich, and Yu. L. Gaponenko, ?Construction of strongly convergent minimizing sequence for a continuous convex functional,? Zh. Vychisl. Matem. i Matem. Fiz.,9, No. 2, 286?299 (1969). · Zbl 0186.21302 |
| [12] |
B. M. Budak and F. P. Vasil’ev, Approximate Methods of Solving Optimal Control Problems (Lectures) I, II [in Russian], Izd. Mosk. Univ., Moscow (1969). |
| [13] |
V. A. Bulavskii, ?Iteration method of solving a linear programming problem,? Dokl. Akad. Nauk SSSR,137, No. 2, 258?260 (1961). |
| [14] |
V. A. Bulavskii, ?Iteration method of solving a general linear programming problem,? Sibirsk. Matem. Zh.,3, No. 3, 313?332 (1962). |
| [15] |
V. A. Bulavskii, ?Extension of the domain of convergence of iteration methods of increasing precision,? Dokl. Akad. Nauk SSSR,205, No. 2, 274?276 (1972). · Zbl 0318.49027 |
| [16] |
V. A. Bulavskii, ?A projection method in mathematical programming,? Sb. Tr. Inst. Matem. Sibirsk. Otd. Akad. Nauk SSSR,5(22), 11?22 (1972). · Zbl 0256.90044 |
| [17] |
V. A. Bulavskii and M. A. Yakovleva, ?Method of successive improvement for convex problems with linear constraints,? Sb. Tr. Inst. Matem. Sib. Otd. Akad. Nauk SSSR,5(22), 37?62 (1972). |
| [18] |
V. A. Bulavskii and G. Sh. Rubinshtein, ?Solution of convex programming problems with linear constraints using a successive improvement method for the admissible vector,? Dokl. Akad. Nauk SSSR,150, No. 2, 231?235 (1963). |
| [19] |
V. A. Volkonskii, ?Optimal planning under large dimension conditions (iteration methods and decomposition principle),? Ekon. i Matem. Metody,1, No. 2, 195?219 (1965). |
| [20] |
V. A. Volkonskii, and S. A. Ivankov, ?Convergence of iteration processes for finding an equilibrium point,? Sibirsk. Matem. Zh.,11, No. 4, 770?781 (1970). |
| [21] |
V. A. Volkonskii, A. B. Pomanskii and A. D. Shapiro, ?Application of iteration algorithms for solving linear programming problems,? Ekon. i Matem. Metody,8, No. 2, 246?255 (1972). |
| [22] |
P. Wolfe, ?New methods in nonlinear programming,? in: Application of Mathematics to Economic Studies (Vol. 3), [Russian translation], Mysl’, Moscow (1965), pp. 312?332. |
| [23] |
I. F. Ganzhela, ?A descent algorithm with constraints,? Zh. Vychisl. Matem. i Matem. Fiz.,10, No. 1, 146?157 (1970). |
| [24] |
S. Gass, Linear Programming, McGraw-Hill (1975). · Zbl 0354.90048 |
| [25] |
M. A. Germanov and V. S. Spiridonov, ?Method of solving systems of nonlinear inequalities,? Vychisl. Matem. i Matem. Fiz.,6, No. 2, 335?336 (1966). · Zbl 0168.40603 |
| [26] |
Yu. B. Germeier, Introduction to Theory of Operations Research [in Russian], Nauka, Moscow (1971), 384 pp. |
| [27] |
E. G. Gol’shtein, ?Generalized gradient method for finding saddle-points,? Ekon. i Matem. Metody,8, No. 4, 569?579 (1972). |
| [28] |
E. G. Gol’shtein and D. B. Yudin, New Trends in Linear Programming [in Russian], Sov. Radio, Moscow (1966), 524 pp. |
| [29] |
E. G. Gol’shtein and D. B. Yudin, ?Computational and synthesis methods for pulsed automated systems. II,? Avtomat. i Telemekhan.,24, No. 12, 1643?1659 (1963). |
| [30] |
A. A. Gorskii, ?Modification of penalty function method for solving convex programming problems,? Izv. Akad. Nauk SSSR, Tekhn. Kibernetika, No. 6, 25?29 (1971). |
| [31] |
L. G. Gurin, B. T. Polyak, and É. V. Raik, ?Projection methods for finding the common point of convex sets,? Zh. Vychisl. Matem. i Matem. Fiz.,7, No. 6, 1211?1228 (1967). |
| [32] |
L. Gurin, Ya. S. Dymarskii, and A. D. Merkulov, Problems and Methods of Optimal Resources Distribution [in Russian], Sov. Radio, Moscow (1968), 463 pp. |
| [33] |
Yu. M. Danilin, ?Minimization of nonlinear functionals in problems with constraints,? Kibernetika No. 3, 110?117 (1970). |
| [34] |
Yu. M. Danilin, ?Minimization methods based on the approximation of the desired functional by a convex functional,? Zh. Vychisl. Matem. i Matem. Fiz.,10, No. 5, 1067?1080 (1970). |
| [35] |
Yu. M. Danilin, ?Conjugate direction methods for solving minimization problems,? Kibernetika, No. 5, 122?136 (1971). |
| [36] |
Yu. M. Danilin, ?Minimization of functions in problems with equality-type constraints,? Kibernetika, No. 2, 88?95 (1971). |
| [37] |
J. M. Danskin, Theory of Max-min and Its Application to Weapons Allocation Problems, Springer-Verlag (1967). · Zbl 0154.20009 |
| [38] |
G. Dantzig, Linear Programming, Its Applications and Generalizations [Russian translation], Progress, Moscow (1966), 600 pp. |
| [39] |
R. Duffin, E. Peterson, and C. Zener, Geometric Programming, Wiley (1967). · Zbl 0171.17601 |
| [40] |
V. F. Dem’yanov, ?Minimization of functions on convex constrained sets,? Kibernetika, No. 6, 65?74 (1965). |
| [41] |
V. F. Dem’yanov, ?Use of second derivatives for minimizing functions on constrained sets,? Vestn. Leningr. Univ., No. 1, 24?32 (1968). |
| [42] |
V. F. Dem’yanov and V. N. Malozemov, Introduction to Minimax [in Russian], Nauka, Moscow (1972), 368 pp. |
| [43] |
V. F. Dem’yanov and V. N. Malozemov, ?Theory of nonlinear minimax problems,? Usp. Matem. Nauk,26, No. 3, 53?104 (1971). |
| [44] |
V. F. Dem’yanov and A. B. Pevnyi, ?Numerical methods for finding saddle-points,? Zh. Vychisl. Matem. i Matem. Fiz.,12, No. 5, 1099?1127 (1972). |
| [45] |
V. F. Dem’yanov and A. M. Rubinov, ?Minimization of a smooth convex functional on a convex set,? Vestn. Leningr. Univ., No. 19, 5?17 (1964). |
| [46] |
V. F. Dem’yanov and A. M. Rubinov, Approximation Methods for Solving Extremal Problems [in Russian], Izd. Leningr. Univ., Leningrad (1968), 180 pp. |
| [47] |
J. B. Dennis, Mathematical Programming and Electric Networks [Russian translation], Izd-vo Inostr. Lit. (1961), 215 pp. |
| [48] |
I. M. Derendyaev, ?Application of parabola method to solving variation problems with constraints,? Sibirsk. Matem. Zh.,10, No. 6, 1214?1223 (1969). |
| [49] |
I. I. Dikin, ?Iteration solution of linear and quadratic programming problems,? Dokl. Akad. Nauk SSSR,174, No. 4, 747?748 (1967). |
| [50] |
E. E. Dudnikov and M. V. Rybashov, ?Methods of solving mathematical programming problems on general-purpose analog computers,? Avtomat. i Telemekhan., No. 5, 109?152 (1967). · Zbl 0162.21002 |
| [51] |
I. I. Eremin, ?Generalization of Motskin-Agmon relaxation method,? Usp. Matem. Nauk,20, No. 2, 183?187 (1965). |
| [52] |
I. I. Eremin, ?Relaxation method of solving systems of inequalities with convex functions in left sides,? Dokl. Akad. Nauk SSSR,160, No. 5, 994?996 (1965). |
| [53] |
I. I. Eremin, ?Penalty method in convex programming,? Kibernetika, No. 4, 63?67 (1967). |
| [54] |
I. I. Eremin, ?Fejér approximations and convex programming problems,? Sibirsk. Matem. Zh.,10, No. 5, 1034?1047 (1969). |
| [55] |
I. I. Eremin, ?Application of Fejér approximation method to solving convex programming problems with discontinuous constraints,? Zh. Vychisl. Matem. i Matem. Fiz.,9, No. 5, 1153?1160 (1969). |
| [56] |
I. I. Eremin, ?Successive programming problems,? Sibirsk. Matem. Zh.,14, No. 1, 53?63 (1973). |
| [57] |
I. I. Eremin and M. A. Kostina, ?Penalty method in linear programming and its computer realization,? Zh. Vychisl. Matem. i Matem. Fiz.,7, No. 6, 1358?1366 (1967). · Zbl 0196.18001 |
| [58] |
I. I. Eremin and V. D. Mazurov, ?Iteration method solving convex programming problems,? Dokl. Akad. Nauk SSSR,170, No. 1, 57?60 (1966). · Zbl 0155.28404 |
| [59] |
Yu. M. Ermol’ev, ?Method of solving nonlinear extremum problems,? Kibernetika, No. 4, 1?17 (1966). |
| [60] |
Yu. M. Ermol’ev, ?Method of generalized stochastic gradients and stochastic quasi-Fejér sequences,? Kibernetika, No. 2, 73?83 (1969). |
| [61] |
Yu. M. Ermol’ev and L. G. Ermol’eva, ?Method of parametric decomposition,? Kibernetika, No. 2, 66?69 (1973). |
| [62] |
Yu. M. Ermol’ev and I. M. Mel’nik, Extremum Problems on Graphs [in Russian], Naukova Dumka, Kiev (1968), 176 pp. |
| [63] |
Yu. M. Ermol’ev and E. A. Nurminskii, ?Limit extremal problems,? Kibernetika, No. 4, 130?132 (1973). |
| [64] |
Yu. M. Ermol’ev and N. Z. Shor, ?Minimization of nondifferentiable functions,? Kibernetika, No. 1, 101?102 (1967). |
| [65] |
L. A. Zhivotovskii, ?Inconsistency conditions on a system of nonlinear inequalities, determination of its inconsistency, and iteration solutions of a convex programming problem,? Sb. Rabot. Vychisl. Tsentra Mosk. Univ.,5, 124?133 (1966). |
| [66] |
W. Zangwill, Nonlinear Programming. A Unique Approach [Russian translation], Sov. Radio, Moscow (1973), 312 pp. |
| [67] |
G. Zoutendejk, Feasible Directions Methods [Russian translation] Izv-vo In. Lit., Moscow (1963), 176 pp. |
| [68] |
S. I. Zukhovitskii and L. I. Avdeeva, Linear and Convex Programs [in Russian], Nauka, Moscow (1967), 460 pp. |
| [69] |
S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, ?An algorithm for solving a convex programming problem,? Dokl. Akad. Nauk SSSR,153, No. 5, 991?994 (1963). |
| [70] |
S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, ?An algorithm for solving a convex Chebyshev approximation problem,? Dokl. Akad. Nauk SSSR,151, No. 1, 27?30 (1963). |
| [71] |
S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, ?Numerical method for solving a convex programming problem in Hilbert space,? Dokl. Akad. Nauk SSSR,163, No. 2, 282?284 (1965). |
| [72] |
S. I. Zukhovitskii, R. A. Polyak, and M. E. Primak, ?Concave multiplayer games (numerical methods),? Ekon. i Matem. Metody,7, No. 6, 888?900 (1971). |
| [73] |
V. V. Ivanov, ?Rapid descent algorithms,? Dokl. Akad. Nauk SSSR,143, No. 4, 775?778 (1962). · Zbl 0202.46202 |
| [74] |
V. V. Ivanov, ?Optimal algorithm for minimizing functions from different classes,? Kibernetika, No. 4, 81?94 (1972). |
| [75] |
V. V. Ivanov and V. E. Truten’, ?Penalty function method,? Kibernetika, No. 2, 67?69 (1968). |
| [76] |
L. V. Kantorovich, Mathematical Methods in Production Control and Planning [in Russian], Izd. Leningr. Univ., Leningrad (1939). |
| [77] |
L. V. Kantorovich and G. P. Akilov, Functional Analysis in Normed Spaces [in Russian], Fizmatgiz, Moscow (1959), 684 pp. · Zbl 0127.06102 |
| [78] |
A. A. Kaplan, ?Calculation of the extremum of a linear function on a convex set,? Dokl. Akad. Nauk SSSR,178, No. 6, 1245?1247 (1968). |
| [79] |
A. A. Kaplan, ?A method of solving convex programming problems,? Ekon. i Matem. Metody,4, No. 1, 111?113 (1968). |
| [80] |
A. A. Kaplan, ?Numerical methods of solving convex programming problems,? in: Optimal Planning [in Russian], No. 17, Novosibirsk (1970), pp. 60?95. |
| [81] |
A. A. Kaplan, ?Realization of feasible direction method,? Sb. Tr. Inst. Matem. Sib. Otd. Akad. Nauk SSSR,5(22), 99?105 (1972). |
| [82] |
S. Karlin, Mathematical Methods and Theory in Games, Programming, and Economics [Russian translation], Mir, Moscow (1964), 838 pp. · Zbl 0139.12704 |
| [83] |
V. G. Karmanov, Lectures on Mathematical Programming [in Russian], Izd. Mosk. Univ., Moscow (1971). |
| [84] |
L. A. Kirievskii and R. A. Polyak, ?Acceleration of the convergence of convex programming methods,? Dokl. Akad. Nauk SSSR,209, No. 5, 1024?1027 (1973). |
| [85] |
N. E. Kirin, Computational Methods in Optimal Control Theory [in Russian], Izd. Leningr. Univ., Leningrad (1968), 144 pp. |
| [86] |
B. I. Korobochkin, ?Generalized Lagrange functions and their properties,? Sb. Tr. Inst. Matem. Sib. Otd. Akad. Nauk SSSR,10(27), 120?127 (1973). |
| [87] |
L. A. Krumm, ?Generalization of gradient method for optimizing integrated power conditions,? Izv. Akad. Nauk SSSR, Energetika i Transport, No. 3, 3?16 (1965). |
| [88] |
H. P. Kunzi and V. Krelle, Nonlinear Programming [translated from German], Sov. Radio, Moscow (1965), 304 pp. |
| [89] |
A. Yu. Levin, ?An algorithm for minimizing convex functions,? Dokl. Akad. Nauk SSSR,160, No. 6, 1244?1247 (1965). |
| [90] |
E. S. Levitin, ?General minimization method for discontinuous extremum problems,? Zh. Vychisl. Matem. i Matem. Fiz.,9, No. 4, 783?806 (1969). |
| [91] |
E. S. Levitin and B. T. Polyak, ?Minimization methods with constraints,? Zh. Vychisl. Matem. i Matem. Fiz.,6, No. 5, 787?823 (1966). |
| [92] |
E. S. Levitin and B. T. Polyak, ?Convergence of minimizing sequences in conditional extremum problems,? Dokl. Akad. Nauk SSSR,168, No. 5, 997?1000 (1966). · Zbl 0161.07002 |
| [93] |
A. I. Lobyrev, ?Minimization of a strictly convex function at the intersection of convex sets,? Sb. Tr. Inst. Matem. Sib. Otd. Akad. Nauk SSSR,5(22), 128?132 (1972). |
| [94] |
V. D. Mazurov, ?Particular iteration methods for solving convex programming problems,? in: Mathematical Methods in Optimal Planning Problems [in Russian], Sverdlovsk (1967), pp. 53?72. |
| [95] |
V. D. Mazurov, ?An absolute optimization method in convex programming problems,? Zh. Vychisl. Matem. i Matem. Fiz.,7, No. 1, 204?208 (1967). |
| [96] |
U. Kh. Malkov, ?Survey of programs for solving a general linear programming problem,? Ekon. i Matem. Metody,5, No. 4, 594?597 (1969). |
| [97] |
M. V. Meerov and B. L. Litvak, ?Mathematical programming in optimization problems of multiconnected systems,? in: Optimization Methods for Multiconnected Control Systems [in Russian], Nauka, Moscow (1972), pp. 5?20. |
| [98] |
V. S. Mikhalevich, Yu. M. Ermol’ev, V. V. Shkurba, and N. Z. Shor, ?Complex systems and the solution of extremal problems,? Kibernetika, No. 5, 29?39 (1967). |
| [99] |
S. M. Movshovich, ?An iteration method for solving linear and convex programming problems,? Ekon. i Matem. Metody,3, No. 4, 593?600 (1967). |
| [100] |
N. N. Moiseev, Numerical Methods in the Theory of Optimal Systems [in Russian], Nauka, Moscow (1971), 424 pp. |
| [101] |
V. A. Morozov, Linear and nonlinear incorrect problems,? in: Progress in Science and Technology. Mathematical Analysis, Vol. 11 [in Russian], Moscow (1973), pp. 129?178. |
| [102] |
E. A. Nurminskii, ?Convergence conditions on nonlinear programming algorithms,? Kibernetika, No. 6, 79?81 (1972). |
| [103] |
E. A. Nurminskii, ?Convergence of gradient projection method,? Kibernetika, No. 5, 84?87 (1973). |
| [104] |
A. B. Pevnyi, ?Particular iteration processes for solving convex games,? Vestn. Leningr. Univ., No. 13, 64?68 (1973). |
| [105] |
A. A. Pervozvanskii, Search [in Russian], Nauka, Moscow (1970), 264 pp. |
| [106] |
V. M. Polterovich, ?Block concave programming methods and their economic interpretation,? Ekon. i Matem. Metody,5, No. 6, 865?876 (1969). |
| [107] |
B. T. Polyak, ?A general method of solving extremal problems,? Dokl. Akad. Nauk SSSR,174, No. 1, 33?36 (1967). · Zbl 0177.15102 |
| [108] |
B. T. Polyak, ?Minimization method for functions of several variables,? Ekon. i Matem. Metody,3, No. 6, 881?901 (1967). |
| [109] |
B. T. Polyak, ?Theory of nonlinear problems in optimal control,? Vestn. Mosk. Univ., Matem., Mekh., No. 2, 30?40 (1968). |
| [110] |
B. T. Polyak, ?Minimization of discontinuous functionals,? Zh. Vychisl. Matem. i Matem. Fiz.,9, No. 3, 509?521 (1969). |
| [111] |
B. T. Polyak, ?A method of solving linear and quadratic programming problems requiring large memory,? in: Computational Methods and Programming, No. 12 [in Russian], Izd. Mosk. Univ., Moscow (1969), pp. 10?17. |
| [112] |
B. T. Polyak, ?Conjugate gradient method in extremum problems,? Zh. Vychisl. Matem. i Matem. Fiz.,9, No. 4, 807?821 (1969). |
| [113] |
B. T. Polyak, ?Iteration methods using Lagrangian multipliers for solving extremum problems with equality-type constraints,? Zh. Vychisl. Matem. i Matem. Fiz.,10, No. 5, 1098?1106 (1970). |
| [114] |
B. T. Polyak, ?Rate of convergence of penalty function method,? Zh. Vychisl. Matem. i Matem. Fiz.,11, No. 1, 3?11 (1971). |
| [115] |
B. T. Polyak, ?Convergence of feasible direction method in extremal problems,? Zh. Vychisl. Matem. i Matem. Fiz.,11, No. 4, 855?869 (1971). |
| [116] |
B. T. Polyak and N. V. Tret’yakov, ?An iteration method of linear programming and its economic interpretation,? Ekon. i Matem. Metody,8, No. 5, 740?751 (1972). |
| [117] |
B. T. Polyak and N. V. Tret’yakov, ?Penalty estimation method for conditional extremum problems,? Zh. Vychisl. Matem. i Matem. Fiz.,13, No. 1, 34?46 (1973). |
| [118] |
R. A. Polyak, ?Algorithm for simultaneous solution of direct and dual convex programming problem,? Ekon. Kibernet. i Issled. Operatsii. Seminar, No. 3, Kiev (1966), pp. 53?64. |
| [119] |
R. A. Polyak, ?Acceleration of convergence of convex programming methods,? Dokl. Akad. Nauk SSSR,212, No. 5, 1063?1066 (1973). |
| [120] |
M. E. Primak, ?Computational process for finding equilibrium points,? Kibernetika, No. 1, 91?96 (1973). |
| [121] |
A. I. Propoi, Elements of the Theory of Optimal Discrete Processes [in Russian], Nauka, Moscow (1973), 256 pp. · Zbl 0247.90061 |
| [122] |
B. N. Pshenichnyi, ?Dual method in extremal problems. I, II,? Kibernetika, No. 3, 89?95; No. 4, 84?69 (1965). |
| [123] |
B. N. Pshenichnyi, ?Algorithms for general mathematical programming problems,? Kibernetika, No. 5, 120?125 (1970). |
| [124] |
B. N. Pshenichnyi, ?Newton’s method for solving a system of equalities and inequalities,? Matem. Zametki,8, No. 5, 635?640 (1970). |
| [125] |
B. N. Pshenichnyi and I. F. Ganzhela, ?Algorithm for solving a convex programming problem with linear constraints,? Kibernetika, No. 3, 81?85 (1970). |
| [126] |
B. S. Razumikhin, ?Iteration method of solving and decomposing linear programming problems,? Avtomat. i Telemekhan., No. 3, 80?97 (1967). |
| [127] |
B. S. Razumikhin, ?Physical simulation method in mathematical programming and in economics. I-VI,? Avtomat. i Telemekhan., No. 3, 125?137; No. 4, 115?128; No. 6, 120?130; No. 11, 111?123 (1972); No. 2, 127?139; No. 4, 87?99 (1973). |
| [128] |
É. Raik, ?Fejér-type methods in Hilbert space,? Izv. Akad. Nauk ÉstSSR, Fiz.,Matem.,16, No. 3, 286?293 (1967). |
| [129] |
É. Raik, ?Penalty function method,? Izv. Akad. Nauk ÉstSSR, Fiz.,Matem.,16, No. 2, 172?180 (1967). · Zbl 0231.90043 |
| [130] |
E. Ya. Remez, Fundamentals of Numerical Methods for Chebyshev Approximations [in Russian], Naukova Dumka, Kiev (1969), 623 pp. |
| [131] |
G. Sh. Rubinshtein, Finite-Dimensional Optimization Models. Lecture Course [in Russian], Izd. Novosibirsk. Univ., Novosibirsk (1970). |
| [132] |
G. Sh. Rubinshtein and V. I. Shmyrev, ?Minimization method for a quasi-convex function on a convex polyhedron,? Sb. Tr. Inst. Matem. Sib. Otd. Akad. Nauk SSSR,1(18), 82?117 (1971). |
| [133] |
M. V. Rybashov, ?Investigation of methods for solving systems of linear equalities, inequalities, linear programming problems, and matrix games on analog computers (Survey),? Avtomat. i Telemekhan., No. 3, 141?164 (1969). |
| [134] |
V. K. Saul’ev and I. I. Samoilova, ?Approximation methods for absolute minimization of functions of several variables,? in: Progress in Science and Technology. Mathematical Analysis [in Russian], Moscow (1973), pp. 91?128. |
| [135] |
Zh. Sea, Optimization: Theories and Algorithms [translated from French], Mir, Moscow (1973), 244 pp. |
| [136] |
V. D. Skarin, ?Penalty functions method for nonlinear programming problems,? Zh. Vychisl. Matem. i Matem. Fiz.,13, No. 5, 1186?1199 (1973). |
| [137] |
V. A. Skokov and L. E. Orlova, ?Minimization algorithm for functions of several variables with general types of constraint (in Algol),? Series on Standard Programs of Solution of Mathematical Programming Problems [in Russian], No. 24, Izd. Mosk. Univ., Moscow (1971). |
| [138] |
Yu. P. Syrov and Sh. S. Churkveidze, Optimization Problems of Interbranch and Interregional Communications in Planning the Development of an Integrated National Economic System (Textbook) [in Russian], Irkutsk Inst., Narodnoro Khozyaistva, Irkutsk (1970). |
| [139] |
A. N. Tikhonov, ?Incorrect optimal planning problems,? Zh. Vychisl. Matem. i. Matem. Fiz.,6, No. 1, 81?89 (1966). |
| [140] |
N. V. Tret’yakov, ?Penalty estimation method for convex programming problems,? Ekon. i Matem. Metody,9, No. 3, 526?540 (1973). |
| [141] |
R. I. Trukhaev and V. V. Khomenyuk, Theory of Nonclassical Variational Problems [in Russian], Izd. Leningr. Univ., Leningrad (1971), 168 pp. · Zbl 0221.49001 |
| [142] |
D. J. Wilde, Optimum-Seeking Methods, Prentice-Hall (1964). · Zbl 0136.14601 |
| [143] |
S. Ulm and V. Poll’, ?Incorrect methods of solving minimum problems,? Izv. Akad. Nauk ÉstSSR, Fiz. Matem.,17, No. 2, 151?163 (1968). |
| [144] |
R. P. Fedorenko, ?Test at an iteration solution of linear programming problems,? Zh. Vychisl. Matem. i Matem. Fiz.,5, No. 4, 709?717 (1965). |
| [145] |
R. P. Fedorenko, ?Iteration solution of linear programming problems,? Zh. Vychisl. Matem. i Matem. Fiz.,10, No. 4, 895?907 (1970). |
| [146] |
R. P. Fedorenko, ?Iteration solution of linear programming problems,? Zh. Vychisl. Matem. i Matem. Fiz.,12, No. 2, 298?308 (1972). |
| [147] |
A. Fiacco and G. McCormick, Nonlinear Programming, Wiley (1968). |
| [148] |
G. Hadley, Nonlinear and Dynamic Programming, Addison-Wesley (1964). · Zbl 0179.24601 |
| [149] |
V. V. Khomenyuk, Optimization Methods [in Russian], Izd. Leningr. Univ., Leningrad (1973), 216 pp. |
| [150] |
F. L. Chernous’ko and N. V. Banichuk, Variational Problems in Mechanics and Control. Numerical Methods [in Russian], Nauka, Moscow (1973), 238 pp. |
| [151] |
L. I. Shatrovskii, ?Numerical method of solving optimal control problems,? Zh. Vychisl. Matem. i Matem. Fiz.,2, No. 3, 488?490 (1962). |
| [152] |
N. Z. Shor, ?Application of gradient descent method for solving network transportation problems,? Materials of the Scientific Seminar on Theory and Applied Problems of Cybernetics. Ekonomich. Kibern. i Issled. Oper., No. 1 (1962). |
| [153] |
N. Z. Shor, ?Generalized gradient descent,? Proc. First Winter School on Math. Programming held at Drogovych [in Russian], Drogobyche, No. 3, Rotaprint TsEMI, Moscow (1969), pp. 578?585. |
| [154] |
N. Z. Shor, ?Use of space dilation operation in minimization problems for convex functions,? Kibernetika, No. 1, 6?12 (1970). |
| [155] |
N. Z. Shor, ?Rate of convergence of generalized gradient descent method with space dilation,? Kibernetika, No. 2, 80?85 (1970). · Zbl 0243.90038 |
| [156] |
N. Z. Shor and N. G. Zhurbenko, ?Minimization method using space dilation operation along the direction of the difference of two successive gradients,? Kibernetika, No. 3, 51?59 (1971). |
| [157] |
T. M. Éneev, ?Application of gradient method to problems in optimal control theory,? Kosmich. Issled,4, No. 5, 651?669 (1966). |
| [158] |
K. J. Arrow, L. Hurwicz, and H. Uzawa, Studies in Linear and Nonlinear Programming, Stanford Univ. Press (1958). · Zbl 0091.16002 |
| [159] |
D. B. Yudin and E. G. Gol’shtein, Linear Programming. Theory and Finite Methods [in Russian], Fizmatgiz, Moscow (1963), 775 pp. |
| [160] |
D. B. Yudin and E. G. Gol’shtein, Problems and Methods of Linear Programming [in Russian], Sov. Radio, Moscow (1964), 736 pp. |
| [161] |
V. A. Yakubovich, ?Recurrent finitely convergent algorithms for solving systems of inequalities,? Dokl. Akad. Nauk SSSR,166, No. 6, 1308?1314 (1966). |
| [162] |
J. Abadie and J. Carpenter, ?Generalization of the Wolfe reduced gradient method to the case of nonlinear constraints,? in: Optimization, Academic Press (1969), pp. 37?48. |
| [163] |
J. Abadie and J. Guigou, ?Numerical experiments with the CGR method,? in: Integer and Nonlinear Programming, North-Holland Publ. Co., Amsterdam (1970), pp. 285?308. · Zbl 0331.65041 |
| [164] |
J. Abraham, ?An approximate method for convex programming,? Econometrica,29, No. 4, 700?703 (1961). · Zbl 0104.14304 · doi:10.2307/1911815 |
| [165] |
S. Agmon, ?The relaxation method for linear inequalities,? Canad. J. Math.,6, No. 3, 382?392 (1954). · Zbl 0055.35001 · doi:10.4153/CJM-1954-037-2 |
| [166] |
R. R. Allran and S. E. J. Johnsen, ?An algorithm for solving nonlinear programming problems subject to nonlinear inequality constraints,? Comput. J.,13, No. 2, 171?177 (1970). · Zbl 0191.17104 · doi:10.1093/comjnl/13.2.171 |
| [167] |
M. Altman, ?A feasible direction method for solving the nonlinear programming problems,? Bull. Acad. Polon. Sci. Sér. Sci. Math., Astron. Phys.,12, No. 1, 43?50 (1964). |
| [168] |
M. Altman, ?A generalized gradient method for the conditional minimum of a functional,? Bull. Acad. Polon. Sci. Sér. Sci. Math., Astron. Phys.,14, No. 8, 445?451 (1966). · Zbl 0189.49802 |
| [169] |
M. Altman, ?A generalized gradient method of minimizing a functional on a nonlinear surface with application to nonlinear programming,? Mathematica (RSR),11, No. 1, 13?27 (1969). · Zbl 0213.17203 |
| [170] |
Anonymous, ?A new algorithm for optimization,? Math. Program,3, No. 2, 124?128 (1972). |
| [171] |
J. Asaadi, ?A computational comparison of some nonlinear programs,? Math. Program,4, No. 2, 144?154 (1973). · Zbl 0259.90044 · doi:10.1007/BF01584657 |
| [172] |
A. Auslender, ?Numerical methods for the decomposition and minimization of nondifferentiable functions,? Numer. Math.,18, No. 3, 213?223 (1971). · Zbl 0215.27504 · doi:10.1007/BF01397082 |
| [173] |
A. Auslender, ?Second-order methods in optimization problems with constraints,? Rev. Franc. Inform. et Rech. Opérat.,3, No.R-2, 27?42 (1969). |
| [174] |
A. Auslender, ?Minimax problems in terms of convex analysis and variational inequalities: theory and algorithms,? Lect. Notes Econ. and Math. Syst.,77, No. 7 (1972), 132 pp. |
| [175] |
A. Auslender and B. Martinet, ?Decomposition methods for minimization of a functional on a product space,? C. R. Acad. Sci.,274, No. 8, A632?635 (1972). |
| [176] |
Y. Bard, ?Comparison of gradient methods for the solution of nonlinear parameter estimation problems,? SIAM J. Numer. Anal.,7, No. 1, 157?186 (1970). · Zbl 0202.16904 · doi:10.1137/0707011 |
| [177] |
Y. Bard and J. L. Greenstadt, ?A modified Newton method for optimization with equality constraints,? in: Optimization, Academic Press, London (1969), pp. 299?306. · Zbl 0215.27503 |
| [178] |
R. O. Barr, ?Computation of optimal controls on convex reachable sets,? in: Math. Theory Control, Academic Press, New York-London (1967), pp. 63?70. · Zbl 0223.65027 |
| [179] |
R. O. Barr and E. G. Gilbert, ?Some efficient algorithms for a class of abstract optimization problems arising in optimal control,? IEEE Trans. Automat. Contr.,14, No. 6, 640?652 (1969). · doi:10.1109/TAC.1969.1099299 |
| [180] |
R. H. Bartles, G. H. Golub, and M. A. Saunders, ?Numerical Techniques in Mathematical Programming,? in: Nonlinear Programming, Academic Press, New York (1970), pp. 123?176. |
| [181] |
E. M. L. Beale, Mathematical Programming in Practice, Pitman, London (1968), 195 pp. |
| [182] |
E. M. L. Beale, ?On minimizing a convex function subject to linear inequalities,? J. Roy. Statist. Soc.,B17, No. 2, 173?184 (1955). · Zbl 0068.13701 |
| [183] |
E. M. L. Beale, ?Numerical methods,? in: Nonlinear Programming, North-Holland Publ. Co., Amsterdam (1967), pp. 133?205. |
| [184] |
E. J. Beltrami, An Algorithmic Approach to Nonlinear Analysis and Optimization, Vol. 14, Academic Press, New York (1970), 235 pp. · Zbl 0207.17202 |
| [185] |
A. Ben-Israel, ?On iterative methods for solving nonlinear least squares problems over convex sets,? Israel J. Math.,5, No. 4, 211?224 (1967). · Zbl 0183.18004 · doi:10.1007/BF02771609 |
| [186] |
S. G. Beveridge and R. S. Schechter, Optimization: Theory and Practice, Vol. 19, McGraw-Hill Book Co., New York (1970), 773 pp. · Zbl 0205.21401 |
| [187] |
E. K. Blum, ?A convergent gradient procedure in prehilbert spaces,? Pacif. J. Math.,18, No. 1, 25?30 (1966). · Zbl 0171.13002 · doi:10.2140/pjm.1966.18.25 |
| [188] |
J. S. Bonner, ?Mathematical programming: computer systems,? in: Progress in Operations Research, Vol. 3, Wiley (1969), pp. 115?134. |
| [189] |
J. C. G. Boot, Quadratic Programming, Vol. 17, North-Holland, Amsterdam (1964), 213 pp. · Zbl 0138.15802 |
| [190] |
M. J. Box, ?A new method of constrained optimization and a comparison with other methods,? Comput. J.,8, No. 1, 42?52 (1965). · Zbl 0142.11305 · doi:10.1093/comjnl/8.1.42 |
| [191] |
M. J. Box, ?A comparison of several current optimization methods and the use of transformations in constrained problems,? Comput. J.,9, No. 1, 67?77 (1966). · Zbl 0146.13304 · doi:10.1093/comjnl/9.1.67 |
| [192] |
M. J. Box, D. Davies, and W. H. Swann, Nonlinear Optimization Techniques, Oliver and Boyl, Edinburgh (1969). |
| [193] |
J. Bracken and G. P. McCormick, Selected Applications of Nonlinear Programming, Vol. 12, Wiley (1968), 110 pp. · Zbl 0194.20502 |
| [194] |
R. J. Braitsch Jr., ?A computer comparison of four quadratic programming algorithms,? Manag. Sci.,18, No. 11, 632?643 (1972). · Zbl 0241.90047 · doi:10.1287/mnsc.18.11.632 |
| [195] |
R. R. Brown, ?The design of optimum systems,? in: Proc. Fifth Annual Computer Appl. Sympos., 1958, Chicago (1959), pp. 83?93. |
| [196] |
Bui-Trong-Lièu and P. Huard, ?Method of centers in topological space,? Numer. Math.,8, No. 1, 56?67 (1966). · Zbl 0171.40802 · doi:10.1007/BF02165238 |
| [197] |
T. Butler and A. V. Martin, ?On a method of Courant for minimizing functionals,? J. Math. Phys.,41, No. 4, 291?299 (1962). · Zbl 0116.08001 · doi:10.1002/sapm1962411291 |
| [198] |
A. R. Butz, ?Iterative saddle point techniques,? SIAM J. Appl. Math.,15, No. 3, 719?725 (1967). · Zbl 0154.44903 · doi:10.1137/0115061 |
| [199] |
M. D. Canon and C. D. Cullum, ?A tight upper bound on the rate of convergence of the Frank-Wolfe algorithm,? SIAM J. Contr.,6, No. 4, 509?516 (1968). · Zbl 0186.24002 · doi:10.1137/0306032 |
| [200] |
M. D. Canon, C. D. Cullum, and E. Polak, Theory of Optimal Control and Mathematical Programming, McGraw-Hill, New York (1970). · Zbl 0264.49001 |
| [201] |
C. W. Carrol, ?The created response surface technique for optimizing nonlinear restrained systems,? Operat. Res.,9, No. 2, 169?184 (1961). · Zbl 0111.17004 · doi:10.1287/opre.9.2.169 |
| [202] |
A. Charnes and W. W. Cooper, ?Nonlinear network flows and convex programming over incidence matrices,? Naval Res. Logist. Quart.,5, No. 3, 231?240 (1958). · doi:10.1002/nav.3800050304 |
| [203] |
R. Chattopadhyay, ?A variance algorithm for constrained minimization with linear constraints,? J. Math. Anal. Appl.,41, No. 2, 320?327 (1973). · Zbl 0265.49019 · doi:10.1016/0022-247X(73)90206-0 |
| [204] |
W. Cheney and A. A. Goldstein, ?Newton’s method for convex programming and Tchebycheff approximation,? Numer. Math.,1, No. 5, 253?268 (1959). · Zbl 0113.10703 · doi:10.1007/BF01386389 |
| [205] |
Y. Cherrualt and P. Loridan, ?Methods for finding saddle points,? J. Math. Anal. Appl.,42, No. 3, 522?535 (1973). · Zbl 0269.90041 · doi:10.1016/0022-247X(73)90160-1 |
| [206] |
A. R. Collville, ?A comparative study on nonlinear programming codes,? IBM New York Scientific Center Technical Rep., No. 320-2949 (1968). |
| [207] |
R. Conn, ?Constrained optimization using a nondifferentiable penalty function,? SIAM J. Numer. Anal.,10, No. 4, 760?784 (1973). · Zbl 0259.90039 · doi:10.1137/0710063 |
| [208] |
R. Courant, ?Variational methods for the solution of problems of equilibrium and vibrations,? Bull. Amer. Math. Soc.,49, No. 1, 1?23 (1943). · Zbl 0063.00985 · doi:10.1090/S0002-9904-1943-07818-4 |
| [209] |
J. W. Daniel, The Approximate Minimization of Functionals, Vol. 11, Prentice-Hall (1971), 228 pp. · Zbl 0223.65014 |
| [210] |
G. B. Dantzig and P. Wolfe, ?Decomposition algorithm for linear programs,? Econometrica,29, No. 4, 767?778 (1961). · Zbl 0104.14305 · doi:10.2307/1911818 |
| [211] |
D. Davies and W. H. Swann, ?Review of constrained optimization,? in: Optimization, Academic Press (1969), pp. 187?202. · Zbl 0206.45601 |
| [212] |
D. Davies and W. H. Swann, ?Global convergence for Newton method in mathematical programming,? Optimiz. Theory Appl., 12, No. 3, 233?241 (1973). · Zbl 0248.65042 · doi:10.1007/BF00935105 |
| [213] |
D. A. D’Esopo, ?A convex programming procedure,? Naval Res. Logist. Quart.,6, No. 1, 33?42 (1959). · doi:10.1002/nav.3800060105 |
| [214] |
W. S. Dorn, ?Nonlinear programming ? a survey,? Manag. Sci.,9, No. 2, 171?208 (1963). · Zbl 0995.90613 · doi:10.1287/mnsc.9.2.171 |
| [215] |
J. Dubois, ?Theorems of convergence for improved nonlinear programming algorithms,? Oper. Res.,21, No. 1, 328?332 (1973). · Zbl 0261.90062 · doi:10.1287/opre.21.1.328 |
| [216] |
B. C. Eaves and W. I. Zangwill, ?Generalized cutting plane algorithms,? SIAM J. Contr.,9, No. 4, 529?542 (1971). · doi:10.1137/0309037 |
| [217] |
P. Faure and P. Huard, ?Solution of mathematical programs for a nonlinear function by the reduced gradient method,? Rev. franc. rech, operat.,9, No. 36, 167?205 (1965). |
| [218] |
R. Fletcher, ?Methods for the solution of optimization problems,? Comput. Phys. Communs.,3, No. 3, 159?172 (1972). · doi:10.1016/0010-4655(72)90065-3 |
| [219] |
R. Fletcher, ?A class of methods for nonlinear programming with termination and convergence properties,? in: Integer and Nonlinear Programming, North-Holland Publ. Co., Amsterdam (1970), pp. 159?176. |
| [220] |
R. Fletcher and S. A. Lill, ?A class of methods for nonlinear programming. II. Computational experience,? in: Nonlinear Programming, Academic Press, New York (1970), pp. 67?92. |
| [221] |
R. Fletcher and A. P. McCann, ?Acceleration technique for nonlinear programming,? in: Optimization, Academic Press, London (1969), pp. 203?214. |
| [222] |
G. E. Forsythe, ?Computing constrained maxima with Lagrange multipliers,? SIAM J.,3, No. 4, 173?178 (1955). |
| [223] |
M. Frank and P. Wolfe, ?An algorithm for quadratic programming,? Naval Res. Logist. Quart,3, Nos. 1?2, 95?110 (1956). · doi:10.1002/nav.3800030109 |
| [224] |
H. Gajewski, ?Über einige Näherungsverfahren zur Lösung nichtlinearer Variationsungleichungen und konvexer Minimumprobleme mit Nebenbedingungen,? Math. Nachr.,46, Nos. 1?6, 275?284 (1970). · Zbl 0181.38702 · doi:10.1002/mana.19700460122 |
| [225] |
H. Gajewski and R. Kluge, ?Projectionsverfahren bei nichtlinearen Variationsungleichungen,? Math. Nachr.,46, Nos. 1?6, 363?373 (1970). · Zbl 0202.38601 · doi:10.1002/mana.19700460128 |
| [226] |
A. M. Geoffrion, ?Elements of large-scale mathematical programming. I. Concepts,? Manag. Sci.,16, 652?675 (1969/1970). · Zbl 0209.22801 · doi:10.1287/mnsc.16.11.652 |
| [227] |
A. M. Geoffrion, ?Elements of large-scale mathematical programming. II. Synthesis of algorithms and bibliography,? Manag. Sci.,16, 676?691 (1969/1970). · doi:10.1287/mnsc.16.11.676 |
| [228] |
E. G. Gilbert, ?An iterative procedure for computing the minimum of a quadratic form on a convex set,? SIAM J. Contr.,4, No. 1, 61?81 (1966). · Zbl 0196.51204 · doi:10.1137/0304007 |
| [229] |
D. Goldfarb, ?Extension of Davidon’s variable metric method to maximization under linear inequality and equality constraints,? SIAM J. Appl. Math.,17, No. 4, 739?764 (1969). · Zbl 0185.42602 · doi:10.1137/0117067 |
| [230] |
D. Goldfarb and L. Lapidus, ?Conjugate gradient method for nonlinear programming problems with linear constraints,? Industr. Engin. Chem. Fund.,7, No. 1, 142?151 (1968). · doi:10.1021/i160025a024 |
| [231] |
A. A. Goldstein, ?Convex programming in Hilbert space,? Bull. Amer. Math. Soc.,70, No. 5, 709?710 (1964). · Zbl 0142.17101 · doi:10.1090/S0002-9904-1964-11178-2 |
| [232] |
H. J. Greenberg, ?The generalized penalty-function (surrogate model),? Oper. Res.,21, No. 1, 162?178 (1973). · Zbl 0261.90056 · doi:10.1287/opre.21.1.162 |
| [233] |
J. L. Greenstadt, ?A ricocheting gradient method for nonlinear optimization,? SIAM J. Appl. Math.,14, No. 3, 429?445 (1966). · Zbl 0149.16801 · doi:10.1137/0114038 |
| [234] |
R. E. Griffith and R. A. Stewart, ?A nonlinear programming technique for the optimization of continuous processing systems,? Manag. Sci.,7, No. 4, 379?392 (1961). · Zbl 0995.90610 · doi:10.1287/mnsc.7.4.379 |
| [235] |
R. C. Grinold, ?Steepest ascent for large scale linear programs,? SIAM Rev.,14, No. 3, 447?484 (1972). · Zbl 0281.90044 · doi:10.1137/1014070 |
| [236] |
P. C. Haarhoff and J. D. Buys, ?A new method for the optimization of a nonlinear function subject to nonlinear constraints,? Comput. J.,13, No. 2, 178?184 (1970). · Zbl 0195.17403 · doi:10.1093/comjnl/13.2.178 |
| [237] |
M. A. Hanson, ?An algorithm for convex programming,? Austral. J. Stat.,5, No. 4, 14?20 (1963). · Zbl 0118.35204 · doi:10.1111/j.1467-842X.1963.tb00133.x |
| [238] |
H. O. Hartley and R. R. Hocking, ?Convex programming by tangential approximation,? Manag. Sci.,9, No. 4, 600?612 (1963). · Zbl 0995.90606 · doi:10.1287/mnsc.9.4.600 |
| [239] |
M. R. Hestenes, ?Multiplier and gradient methods,? J. Optimiz. Theory and Appl.,4, No. 5, 303?320 (1969). · Zbl 0174.20705 · doi:10.1007/BF00927673 |
| [240] |
D. M. Himmelblau, Applied Nonlinear Programming, McGraw-Hill, New York (1972). · Zbl 0241.90051 |
| [241] |
C. A. Holloway, ?A generalized approach to Dantzig-Wolfe decomposition for concave programs,? Oper. Res.,21, No. 1, 210?220 (1973). · Zbl 0283.90044 · doi:10.1287/opre.21.1.210 |
| [242] |
P. Huard, ?Mathematical convex programming,? Rev. Franc. Inform. Rech. Opérat.,2, No. 7, 43?59 (1968). |
| [243] |
P. Huard, ?A method of centers by upper-bounding functions with applications,? in: Nonlinear Programming, Academic Press, New York (1970), pp. 1?30. · Zbl 0253.90049 |
| [244] |
P. Huard, ?The future of nonlinear programming,? Rev. Franc. Inform. Rech. Opérat.,5, No. R-1, 3?48 (1971). |
| [245] |
D. H. Jacobson and D. Q. Mayne, Differential Dynamic Programming, Elsevier, New York (1970), 208 pp. · Zbl 0223.49022 |
| [246] |
S. L. S. Jacoby, J. S. Kowalik, and J. T. Pizzo, Iterative Methods for Nonlinear Optimization, Prentice-Hall, Englewood Cliffs, N. J. (1972). · Zbl 0315.65036 |
| [247] |
H. J. Kelley, W. F. Denham, I. L. Johnson, and P. O. Wheatley, ?An accelerated gradient method for parameter optimization with nonlinear constraints,? J. Astronaut. Sci.,13, No. 4, 166?169 (1966). |
| [248] |
J. E. Kelley, ?The cutting-plane method for solving convex programs,? SIAM J.,8, No. 4, 703?712 (1960). |
| [249] |
R. Klessig and E. Polak, ?A method of feasible directions using function approximations with applications to min max problems,? J. Math. Anal. Appl.,41, No. 3, 583?602 (1973). · Zbl 0253.90046 · doi:10.1016/0022-247X(73)90233-3 |
| [250] |
R. Kluge, ?Ein Projektions-Iterationsverfahren zur approximativen Lösung von Minimumproblemen mit Nebenbedingungen und Variationsungleichungen mit nichtlinearen Potentialoperatoren,? Monatsber. Dtsch. Akad. Wiss. Berlin,12, No. 10, 721?734 (1970). · Zbl 0223.49038 |
| [251] |
R. Kluge and G. Bruckner, ?Iterationsverfahren fur einige nichtlineare Probleme mit Nebendetidingungen,? Math. Nachr.,56, Nos. 1?6, 345?369 (1973). · Zbl 0245.65028 · doi:10.1002/mana.19730560130 |
| [252] |
J. Kowalik, M. R. Osborne, and D. M. Ryan, ?A new method for constrained optimization problems,? Operat. Res.,17, No. 6, 973?983 (1969). · Zbl 0183.49005 · doi:10.1287/opre.17.6.973 |
| [253] |
H. P. Kunzi, H. G. Tzschach, and C. A. Zehnder, Numerical Methods of Mathematical Optimization with ALGOL and FORTRAN Programs (Correct., augment., transi. edn.), Academic Press, New York (1971), 219 pp. |
| [254] |
H. P. Kunzi and W. Oettli, Nichtlineare Optimierung: Neure Verfahren Bibliographie, Springer, Berlin (1969), 180 pp. |
| [255] |
H. Kwakernaak and R. C. W. Strijbos, ?Extremization of functions with equality constraints,? Math. Program.,2, No. 3, 279?295 (1972). · Zbl 0346.90044 · doi:10.1007/BF01584549 |
| [256] |
L. Lasdon, Optimization Theory for Large Systems, Macmillan, London (1970), 523 pp. · Zbl 0224.90038 |
| [257] |
L. Lasdon, ?An efficient algorithm for minimizing barrier and penalty functions,? Math. Program.,2, No. 1, 65?106 (1972). · Zbl 0247.90056 · doi:10.1007/BF01584537 |
| [258] |
F. A. Lootsma, ?Constrained optimization via penalty functions,? Philips Res. Repts.,23, No. 5, 408?423 (1968). |
| [259] |
D. G. Luenberger, Optimization by Vector Space Methods, Vol. 17, Wiley, New York (1969), 326 pp. · Zbl 0176.12701 |
| [260] |
D. G. Luenberger, ?The conjugate residual method for constrained minimization problems,? SIAM J. Numer. Anal.,7, No. 3, 390?398 (1970). · Zbl 0209.17601 · doi:10.1137/0707032 |
| [261] |
D. G. Luenberger, ?Convergence rate of a penalty-function scheme,? J. Optimiz. Theory Appl.,7, No. 1, 39?51 (1971). · Zbl 0194.20405 · doi:10.1007/BF00933591 |
| [262] |
D. G. Luenberger, ?The gradient projection method along geodesics,? Manag. Sci.,18, No. 11, 620?631 (1972). · Zbl 0253.90050 · doi:10.1287/mnsc.18.11.620 |
| [263] |
D. G. Luenberger, ?An approach to nonlinear programming,? J. Optimiz. Theory Appl.,11, No. 3, 219?227 (1973). · Zbl 0241.90052 · doi:10.1007/BF00935189 |
| [264] |
O. L. Mangasarian, Nonlinear Programming, Vol. 8, McGraw-Hill, New York (1969), 222 pp. · Zbl 0194.20201 |
| [265] |
O. L. Mangasarian, ?Dual, feasible direction algorithms,? in: Techniques of Optimization, Academic Press, New York (1972), pp. 67?88. |
| [266] |
K. Martensson, ?A new approach to constrained function optimization,? J. Optimiz. Theory Appl.,12, No. 6, 531?554 (1973). · Zbl 0253.49024 · doi:10.1007/BF00934776 |
| [267] |
G. P. McCormick, ?A second-order method for the linearly constained nonlinear programming problems,? in: Nonlinear Programming, Academic Press, New York (1970), pp. 207?243. |
| [268] |
G. P. McCormick, ?Penalty function versus nonpenalty function method for constrained nonlinear programming problems,? Math. Progr.,1, No. 2, 217?238 (1971). · Zbl 0242.90051 · doi:10.1007/BF01584087 |
| [269] |
G. P. McCormick and R. A. Tapia, ?The gradient projection method under mild differentiability conditions,? SIAM J. Contr.,10, No. 1, 93?98 (1972). · Zbl 0237.49019 · doi:10.1137/0310009 |
| [270] |
S. F. McCormick, ?A general approach to one-step iterative methods with application to eigenvalue problems,? J. Comput. Syst. Sci.,6, No. 4, 354?372 (1972). · Zbl 0265.65023 · doi:10.1016/S0022-0000(72)80027-8 |
| [271] |
G. G. L. Meyer, ?A drivable method of feasible directions,? SIAM J. Contr.,11, No. 1, 113?118 (1973). · Zbl 0255.90052 · doi:10.1137/0311009 |
| [272] |
G. G. L. Meyer and E. Polak, ?Abstract models for the synthesis of optimization algorithms,? SIAM J. Contr.,9, No. 4, 547?560 (1971). · Zbl 0209.16704 · doi:10.1137/0309039 |
| [273] |
A. Miele, J. C. Heideman, and J. N. Damoulakis, ?The restoration of constraints in holonomic and nonholonomic problems,? J. Optimiz. Theory Appl.,3, No. 5, 361?381 (1969). · Zbl 0172.13001 · doi:10.1007/BF00931372 |
| [274] |
A. Miele, H. Y. Huang, and J. C. Heideman, ?Sequential gradient-restoration algorithm for the minimization of constrained functions ? ordinary and conjugate gradient versions,? J. Optimiz. Theory Appl.,4, No. 4, 213?243 (1969). · Zbl 0174.14403 · doi:10.1007/BF00927947 |
| [275] |
A. Miele and A. V. Levy, ?Modified quasilinearization and optimal initial choice of the multipliers,? J. Optimiz. Theory Appl.,6, No. 5, 364?380 (1970). · Zbl 0211.45803 · doi:10.1007/BF00932583 |
| [276] |
A. Miele, A. V. Levy, and E. E. Gragg, ?Modifications and extensions of the conjugate gradientrestoration algorithm for mathematical programming problems,? J. Optimiz. Theory Appl.,7, No. 6, 450?472 (1971). · doi:10.1007/BF00931981 |
| [277] |
A. Miele, P. E. Moseley, A. V. Levy, and G. M. Coggins, ?On the method of multipliers for mathematical programming problems,? J. Optimiz. Theory Appl.,10, No. 1, 1?33 (1972). · Zbl 0236.90063 · doi:10.1007/BF00934960 |
| [278] |
D. D. Morrison, ?Optimization by least squares,? SIAM J. Numer. Anal.,5, No. 1, 83?88 (1968). · Zbl 0165.50304 · doi:10.1137/0705006 |
| [279] |
T. S. Motzkin and I. J. Shoenberg, ?The relaxation method for linear inequalities,? Canad. J. Math.,6, No. 3, 393?404 (1954). · Zbl 0055.35002 · doi:10.4153/CJM-1954-038-x |
| [280] |
B. A. Murtagh and R. W. H. Sargent, ?A constrained minimization method with quadratic convergence,? in: Optimization, Academic Press, London (1969), pp. 215?246. · Zbl 0214.42401 |
| [281] |
W. Oettli, ?An iterative method, having linear rate of convergence, for solving a pair of dual linear programs,? Math. Program.,3, No. 3, 302?311 (1972). · Zbl 0259.90019 · doi:10.1007/BF01585003 |
| [282] |
M. R. Osborne and D. M. Ryan, ?On penalty function methods for nonlinear problems,? J. Math. Anal. Appl.,31, No. 3, 559?578 (1970). · Zbl 0198.24602 · doi:10.1016/0022-247X(70)90009-0 |
| [283] |
D. A. Paviani and D. M. Himmelblau, ?Constrained nonlinear optimization by heuristic programming,? Operat. Res.,17, No. 5, 872?882 (1969). · Zbl 0184.23003 · doi:10.1287/opre.17.5.872 |
| [284] |
T. Pietzykowski, ?On an iteration method for maximizing a concave function on a convex set,? Prace Zakladu Apparat. Mat., PAN Ser. A, No. 13 (1961). |
| [285] |
T. Pietzykowski, ?An exact potential method for constrained maxima,? SIAM J. Numer. Anal.,6, No. 2, 299?304 (1969). · Zbl 0181.46501 · doi:10.1137/0706028 |
| [286] |
O. Pironneau and E. Polak, ?Rate of convergence of a class of methods of feasible directions,? SIAM J. Numer. Anal.,10, No. 1, 161?174 (1973). · Zbl 0283.65032 · doi:10.1137/0710017 |
| [287] |
I. Pirzl, ?Optimierung unter Nebenbedingungen. Struktur einer Klasse von Algorithmen. I, II,? Computing Rev.,8, Nos. 1?2, 121?142; Nos. 3?4, 272?283 (1971). · Zbl 0246.90047 · doi:10.1007/BF02234049 |
| [288] |
E. Polak, Computational Methods in Optimization. A Unified Approach, Vol. 17, Academic Press, New York (1971), 329 pp. |
| [289] |
E. Polak, ?A historical survey of computational methods in optimal control,? SIAM Rev.,15, No. 2, 553?584 (1973). · Zbl 0274.49001 · doi:10.1137/1015071 |
| [290] |
M. J. D. Powell, ?A method for nonlinear constraints in minimization problems,? in: Optimization, Academic Press, London (1969), pp. 283?298. |
| [291] |
P. S. Pütter, ?Ein allgemeines Maximalisierungsverfahren,? Z.Angnew.Math. und Mech.,39, No. 12, 466?472 (1959). · Zbl 0090.33701 · doi:10.1002/zamm.19590391203 |
| [292] |
S. W. Rauch, ?A convergence theory for a class of nonlinear programming problems,? SIAM J. Numer. Anal.,10, No. 1, 207?228 (1973). · Zbl 0258.90042 · doi:10.1137/0710021 |
| [293] |
S. M. Robinson, ?A quadratically convergent algorithm for general nonlinear programming problems,? Math. Program,3, No. 2, 145?156 (1972). · Zbl 0264.90041 · doi:10.1007/BF01584986 |
| [294] |
S. M. Robinson, ?Extension of Newton’s method to nonlinear functions with values in a cone,? Numer. Math.,19, No. 4, 341?347 (1972). · Zbl 0227.65040 · doi:10.1007/BF01404880 |
| [295] |
R. T. Rockafellar, ?The multiplier method of Hestenes and Powell applied to convex programming,? J. Optimiz. Theory Appl.,12, No. 6, 555?562 (1973). · Zbl 0254.90045 · doi:10.1007/BF00934777 |
| [296] |
J. B. Rosen, ?The gradient projection method for nonlinear programming. I. Linear constraints,? SIAM J.,8, No. 1, 180?217 (1960). · Zbl 0099.36405 |
| [297] |
J. B. Rosen, ?The gradient projection method for nonlinear programming. II. Nonlinear constraints,? SIAM J.,9, No. 4, 514?532 (1961). · Zbl 0231.90048 |
| [298] |
J. B. Rosen, ?Iterative solution of nonlinear optimal control problems,? SIAM J. Contr.,4, No. 1, 223?244 (1966). · Zbl 0229.49025 · doi:10.1137/0304021 |
| [299] |
J. B. Rosen and S. Suzuki, ?Construction of nonlinear programming test problems,? Commun. ACM,8, No. 2, 113 (1965). · doi:10.1145/363744.363779 |
| [300] |
P. Rosenbloom, ?The method of steepest descent,? Proc. Sympos. Appl. Math.,6, 127?177 (1956). · Zbl 0073.33702 · doi:10.1090/psapm/006/0079339 |
| [301] |
R. W. H. Sargent and B. A. Murtagh, ?Projection methods for nonlinear programming,? Math. Program.,4, No. 3, 245?268 (1973). · Zbl 0304.90097 · doi:10.1007/BF01584669 |
| [302] |
R.W. H. Sargent and D. J. Sebastian, ?On the convergence of sequential minimization algorithms,? J. Optimiz. Theory Appl.,12, No. 6, 567?575 (1973). · Zbl 0253.65037 · doi:10.1007/BF00934779 |
| [303] |
H. K. Schultz, ?A Kuhn-Tucker algorithm,? SIAM J. Contr.,11, No. 3, 438?445 (1973). · Zbl 0259.90035 · doi:10.1137/0311036 |
| [304] |
D. Shanno, ?An accelerated gradient projection method for linearly constrained nonlinear estimation,? SIAM J. Appl. Math.,18, No. 2, 322?334 (1970). · Zbl 0195.19803 · doi:10.1137/0118027 |
| [305] |
H. A. Spang, ?A review of minimization techniques for nonlinear functions,? SIAM Rev.4, No. 4, 343?365 (1962). · Zbl 0112.12205 · doi:10.1137/1004089 |
| [306] |
J. Szymanowsky, ?Przeglad method poszukiwania ekstremum z ograniczeniami,? Archiwum Autom. Telemech.,16, No. 2, 205?221 (1971). |
| [307] |
D. Tabak and B. C. Kuo, Optimal Control by Mathematical Programming, Vol. 13, Prentice-Hall, Englewood Cliffs, N. J. (1971), 237 pp. · Zbl 0176.39401 |
| [308] |
C. Tompkins, ?Projection methods in calculation,? Proc. Second Sympos. Linear Programming, Vol. 2, Washington (1955), pp. 425?448. |
| [309] |
D. M. Topkis, ?Cutting plane methods without nested constraint sets,? Operat. Res.,18, No. 3, 404?413 (1970). · Zbl 0205.21903 · doi:10.1287/opre.18.3.404 |
| [310] |
D. M. Topkis and A. F. Veinott, ?On the convergence of some feasible direction algorithms for nonlinear programming,? SIAM J. Contr.,5, No. 2, 268?279 (1967). · Zbl 0158.18805 · doi:10.1137/0305018 |
| [311] |
S. S. Tripathi and K. S. Narendra, ?Constrained optimization problems using multiplier methods,? J. Optimiz. Theory Appl.,9, No. 1, 59?70 (1972). · Zbl 0213.15702 · doi:10.1007/BF00932805 |
| [312] |
P. P. Varaiya, Notes on Optimization (1972). |
| [313] |
A. F. Veinott, ?The supporting hyperplane method for unimodal programming,? Operat. Res.,15, No. 1, 147?152 (1967). · Zbl 0147.38604 · doi:10.1287/opre.15.1.147 |
| [314] |
P. Wegner, ?A nonlinear extension of the simplex method,? Manag. Sci.,7, No. 1, 43?55 (1960). · Zbl 0995.90624 · doi:10.1287/mnsc.7.1.43 |
| [315] |
W. W. White, ?A status report on computing algorithms for mathematical programming,? ACM Computing Surveys, No. 3, 135?166 (1973). · Zbl 0272.68034 · doi:10.1145/356619.356620 |
| [316] |
P. Whittle, Optimization under Constraints. Theory and Application of Nonlinear Programming, Vol. 9, Wiley, London (1971), 241 pp. · Zbl 0218.90041 |
| [317] |
A. Wierzbicki, ?A penalty function shifting method in constrained static optimization and its convergence properties,? Arch. Automat. i Telemech.,16, No. 4, 395?416 (1971). · Zbl 0227.90045 |
| [318] |
P. Wolfe, ?Accelerating the cutting plane method for nonlinear programming,? SIAM J.,9, No. 3, 481?488 (1961). · Zbl 0109.14102 |
| [319] |
P. Wolfe, ?Methods of nonlinear programming,? in: Nonlinear Programming, North-Holland Publ. Co., Amsterdam (1967), pp. 97?131. · Zbl 0178.22802 |
| [320] |
P. Wolfe, ?On the convergence of gradient methods under constraints,? IBM J. Res. Dev.,16, No. 4, 407?411 (1972). · Zbl 0265.90046 · doi:10.1147/rd.164.0407 |
| [321] |
J. Za?ková, ?On maximizing a concave function subject to linear constraints by Newton’s method,? Aplikaee Mat.,13, No. 4, 339?355 (1968). |
| [322] |
G. Zettl, ?Ein Verfahren zum Minimieren einer Funktion bei eingeschränkten Variationsbereich der Parameter,? Numer. Math.,15, No. 5, 415?432 (1970). · Zbl 0219.65054 · doi:10.1007/BF02165512 |
| [323] |
G. Zoutendijk, ?Nonlinear programming: a numerical survey,? SIAM J. Contr.,4, No. 1, 194?210 (1966). · Zbl 0146.13303 · doi:10.1137/0304019 |
| [324] |
G. Zoutendijk, ?Nonlinear programming: computational methods,? in: Integer and Nonlinear Programming, North-Holland Publ. Co., Amsterdam (1970), pp. 37?86. · Zbl 0216.26902 |
| [325] |
G. Zoutendijk, ?Some algorithms based on the principle of feasible directions, in: Nonlinear Programming,? Academic Press, New York (1970), pp. 93?122. · Zbl 0254.90050 |
