Convergence and efficiency of subgradient methods for quasiconvex minimization
暂无分享,去创建一个
[1] Harvey J. Greenberg,et al. Surrogate Mathematical Programming , 1970, Oper. Res..
[2] Harvey J. Greenberg,et al. A Review of Quasi-Convex Functions , 1971, Oper. Res..
[3] Fred Glover,et al. Surrogate Constraint Duality in Mathematical Programming , 1975, Oper. Res..
[4] I. Ekeland,et al. Convex analysis and variational problems , 1976 .
[5] Martin Dyer. Calculating surrogate constraints , 1980, Math. Program..
[6] W. Ziemba,et al. Generalized concavity in optimization and economics , 1981 .
[7] Ronald L. Rardin,et al. Surrogate Dual Multiplier Search Procedures in Integer Programming , 1984, Oper. Res..
[8] F. Plastria. Lower subdifferentiable functions and their minimization by cutting planes , 1985 .
[9] Naum Zuselevich Shor,et al. Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.
[10] Jarosław Sikorski. Quasi — Subgradient algorithms for calculating surrogate constraints , 1986 .
[11] Jean-Paul Penot,et al. On Quasi-Convex Duality , 1990, Math. Oper. Res..
[12] J. Martínez-Legaz,et al. Fractional programming by lower subdifferentiability techniques , 1991 .
[13] P. Shunmugaraj. Well-set and well-posed minimization problems , 1995 .
[14] J. Penot. Conditioning convex and nonconvex problems , 1996 .
[15] T. Zolezzi. Extended well-posedness of optimization problems , 1996 .
[16] O. Cornejo,et al. Conditioning and Upper-Lipschitz Inverse Subdifferentials in Nonsmooth Optimization Problems , 1997 .
[17] Alfredo N. Iusem,et al. On the projected subgradient method for nonsmooth convex optimization in a Hilbert space , 1998, Math. Program..
[18] J. Penot. Are Generalized Derivatives Sseful for Generalized Convex Functions , 1998 .