A smoothing-out technique for min—max optimization
暂无分享,去创建一个
[1] M. J. D. Powell,et al. An efficient method for finding the minimum of a function of several variables without calculating derivatives , 1964, Comput. J..
[2] W. Zangwill. Non-Linear Programming Via Penalty Functions , 1967 .
[3] G. W. Stewart,et al. A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives , 1967, JACM.
[4] A. Conn. Constrained Optimization Using a Nondifferentiable Penalty Function , 1973 .
[5] K. Madsen. An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations , 1975 .
[6] D. Bertsekas. Nondifferentiable optimization via approximation , 1975 .
[7] C. Charalambous,et al. Non-linear minimax optimization as a sequence of least pth optimization with finite values of p , 1976 .
[8] Arthur M. Geoffrion,et al. Objective function approximations in mathematical programming , 1977, Math. Program..
[9] Kaj Madsen,et al. Linearly constrained minimax optimization , 1978, Math. Program..
[10] Israel Zang,et al. A new arc algorithm for unconstrained optimization , 1978, Math. Program..