Applications of interval arithmetic in non-smooth global optimization. - Peiping Shen; Kecun Zhang; Yanjun Wang 001 (Appl. Math. Comput., 2003)

Global optimization of nonlinear sum of ratios problem. - Yanjun Wang 001; Ke-Cun Zhang (Appl. Math. Comput., 2004)

A new two-level linear relaxed bound method for geometric programming problems. - Yuelin Gao; Chengxian Xu; Yanjun Wang 001; Liansheng Zhang (Appl. Math. Comput., 2005)

A new pruning test for finding all global minimizers of nonsmooth functions. - Peiping Shen; Yanjun Wang 001 (Appl. Math. Comput., 2005)

A deterministic global optimization algorithm for generalized geometric programming. - Yanjun Wang 001; Zhian Liang (Appl. Math. Comput., 2005)

The model and algorithm for the optimization of the granularity distribution. - Zai-En Hou; Kecun Zhang; Yanjun Wang 001 (Appl. Math. Comput., 2006)

Local saddle point and a class of convexification methods for nonconvex optimization problems. - Tao Li; Yanjun Wang 001; Zhian Liang; Panos M. Pardalos (J. Glob. Optim., 2007)

Global optimality conditions for cubic minimization problem with box or binary constraints. - Yanjun Wang 001; Zhian Liang (J. Glob. Optim., 2010)

Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment. - Yanjun Wang 001; Ruizhi Shi; Jianming Shi (J. Glob. Optim., 2015)