×

zbMATH — the first resource for mathematics

A smoothing-out technique for min-max optimization. (English) Zbl 0468.90064

MSC:
90C30 Nonlinear programming
65K05 Numerical mathematical programming methods
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] D.P. Bertsekas, ”Nondifferentiable optimization via approximation”,Mathematical Programming Study 3 (1975) 1–25. · Zbl 0383.49025
[2] C. Charalambous and J.W. Bandler, ”Non-linear minimax optimization as a sequence of leastpth optimization with finite values ofp”,International Journal of Systems Science 7 (1976) 377–391. · Zbl 0349.90108
[3] A.R. Conn, ”Constrained optimization using a nondifferentiable penalty function”,SIAM Journal on Numerical Analysis 10 (1973) 760–784. · Zbl 0259.90039
[4] A.M. Geoffrion, ”Objective function approximations in mathematical programming”,Mathematical Programming 13 (1977) 23–37. · Zbl 0356.90062
[5] S.E. Hersom, ”Smoothing for piece-wise linear functions”, Technical Report No. 71, Numerical Optimisation Centre, The Hatfield Polytechnic (Hatfield, 1975).
[6] K. Madsen, ”An algorithm for minimax solution of overdetermined systems of non-linear equations”,Journal of the Institute of Mathematics and its Applications 16 (1975) 321–328. · Zbl 0355.65038
[7] K. Madsen and H. Schaer-Jacobsen, ”Linearly constrained minimax optimization”,Mathematical Programming 14 (1978) 208–223. · Zbl 0375.65034
[8] M.J.D. Powell, ”An efficient method for finding the minimum of a function of several variables without calculating derivatives”,The Computer Journal 7 (1964) 155–162. · Zbl 0132.11702
[9] G.W. Stewart, ”A modification of Davidon’s minimization method to accept difference approximations of derivatives”,Journal of the Association for Computing Machinery 14 (1967) 72–83. · Zbl 0239.65056
[10] A. Tishler and I. Zang, ”A new maximum likelihood method for piecewise regression”, Working Paper No. 526/77/R, Faculty of Management, Tel Aviv University (Tel Aviv, August 1977 (Revised July 1979)). · Zbl 0474.65099
[11] A. Tishler and I. Zang, ”An absolute deviations curve fitting algorithm for non-linear models”, Working Paper No. 577/78, Faculty of Management, Tel Aviv University (Tel Aviv, October 1978 (Revised August 1979)). · Zbl 0532.65006
[12] I. Zang, ”A new arc algorithm for unconstrained optimization”,Mathematical Programming 15 (1978) 36–52. · Zbl 0392.90076
[13] W.I. Zangwill, ”Non-linear programming via penalty functions”,Management Science 13 (1967) 344–358. · Zbl 0171.18202
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.