An Algorithm Based on Active Sets and Smoothing for Discretized Semi-Infinite Minimax Problems
暂无分享,去创建一个
[1] G. Zoutendijk,et al. Methods of Feasible Directions , 1962, The Mathematical Gazette.
[2] D. Bertsekas,et al. A new penalty function method for constrained minimization , 1972, CDC 1972.
[3] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .
[4] D. Bertsekas. Nondifferentiable optimization via approximation , 1975 .
[5] D. Bertsekas. Approximation procedures based on the method of multipliers , 1977 .
[6] R. Fletcher. Practical Methods of Optimization , 1988 .
[7] Xing-Si Li,et al. AN AGGREGATE FUNCTION METHOD FOR NONLINEAR PROGRAMMING , 1991 .
[8] Li Xingsi,et al. AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATION , 1992 .
[9] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[10] Elijah Polak,et al. Optimization: Algorithms and Consistent Approximations , 1997 .
[11] Ji-Ming Peng,et al. A non-interior continuation method for generalized linear complementarity problems , 1999, Math. Program..
[12] R. Fletcher,et al. Practical Methods of Optimization: Fletcher/Practical Methods of Optimization , 2000 .
[13] Ian H. Sloan,et al. How good can polynomial interpolation on the sphere be? , 2001, Adv. Comput. Math..
[14] Song Xu,et al. Smoothing Method for Minimax Problems , 2001, Comput. Optim. Appl..
[15] Johannes O. Royset,et al. Algorithms with Adaptive Smoothing for Finite Minimax Problems , 2003 .