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

Global optimization of signomial geometric programming using linear relaxation. - Peiping Shen; Kecun Zhang (Appl. Math. Comput., 2004)

A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems. - Yuelin Gao; Honggang Xue; Peiping Shen (Appl. Math. Comput., 2005)

Linearization method of global optimization for generalized geometric programming. - Peiping Shen (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 branch-and-bound algorithm to globally solve the sum of several linear ratios. - Yanjun Wang; Peiping Shen; Zhian Liang (Appl. Math. Comput., 2005)

Global optimization of generalized linear fractional programming with nonlinear constraints. - Hongwei Jiao; Yunrui Guo; Peiping Shen (Appl. Math. Comput., 2006)

Linearization method for a class of multiplicative programming with exponent. - Peiping Shen; Hongwei Jiao (Appl. Math. Comput., 2006)

A new rectangle branch-and-pruning approach for generalized geometric programming. - Peiping Shen; Hongwei Jiao (Appl. Math. Comput., 2006)

A note on the paper global optimization of nonlinear sum of ratios. - Hongwei Jiao; Peiping Shen (Appl. Math. Comput., 2007)

A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints. - Peiping Shen; Yunpeng Duan; Yuan Ma (Appl. Math. Comput., 2008)

A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints. - Peiping Shen; Minna Gu (Appl. Math. Comput., 2008)

A robust algorithm for generalized geometric programming. - Peiping Shen; Yuan Ma; Yongqiang Chen (J. Glob. Optim., 2008)

Solving sum of quadratic ratios fractional programs via monotonic function. - Peiping Shen; Yongqiang Chen; Yuan Ma (Appl. Math. Comput., 2009)

Global optimization for the generalized polynomial sum of ratios problem. - Peiping Shen; Yuan Ma; Yongqiang Chen (J. Glob. Optim., 2011)

Global Optimization for the Sum of Linear Ratios Problem over Convex Feasible Region. - Li Jin; Rui Wang; Peiping Shen (ICSI (2), 2012)

Maximizing for the sum of ratios of two convex functions over a convex set. - Peiping Shen; Weimin Li; Xiaodi Bai (Comput. Oper. Res., 2013)

Branch-reduction-bound algorithm for generalized geometric programming. - Peiping Shen; Xiaoai Li (J. Glob. Optim., 2013)

Range division and contraction algorithm for a class of global optimization problems. - Peiping Shen; Linpeng Yang; Yanchao Liang (Appl. Math. Comput., 2014)

A practicable contraction approach for the sum of the generalized polynomial ratios problem. - Peiping Shen; Zeyi Zhu; Xiao Chen (Eur. J. Oper. Res., 2019)

Range division and linearization algorithm for a class of linear ratios optimization problems. - Peiping Shen; Bingdi Huang; Lufan Wang (J. Comput. Appl. Math., 2019)

Outer space branch and bound algorithm for solving linear multiplicative programming problems. - Peiping Shen; Kaimin Wang; Ting Lu (J. Glob. Optim., 2020)

Global algorithm for solving linear multiplicative programming problems. - Peiping Shen; Bingdi Huang (Optim. Lett., 2020)

A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. - Chunfeng Wang; Yaping Deng; Peiping Shen (J. Comput. Appl. Math., 2022)

A new bat algorithm based on a novel topology and its convergence. - Chunfeng Wang; Wenxin Song; Peiping Shen (J. Comput. Sci., 2023)

Efficient algorithm for globally computing the min-max linear fractional programming problem. - Hongwei Jiao; Wenjie Wang; Li Ge; Peiping Shen; Youlin Shang (RAIRO Oper. Res., 2023)

Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound. - Peiping Shen; Dianxiao Wu; Kaimin Wang (J. Glob. Optim., 2023)

An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming. - Peiping Shen; Dianxiao Wu; Yafei Wang (J. Comput. Appl. Math., 2023)

A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem. - Peiping Shen; Yafei Wang; Dianxiao Wu (Numer. Algorithms, 2023)

An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation. - Bingdi Huang; Peiping Shen (Comput. Appl. Math., 2024)

A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming. - Peiping Shen; Yaping Deng; Yafei Wang (J. Comput. Appl. Math., 2024)

An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs. - Yanzhen Zhang; Peiping Shen; Bingdi Huang; Yaping Deng (J. Comput. Appl. Math., 2024)

Bi-affine scaling iterative method for convex quadratic programming with bound constraints. - Hongwei Yue; Peiping Shen (Math. Comput. Simul., 2024)

A criterion space algorithm for solving linear multiplicative programming problems. - Peiping Shen; Yaping Deng; Dianxiao Wu (Numer. Algorithms, 2024)

An outcome space algorithm for solving general linear multiplicative programming. - Yanzhen Zhang; Peiping Shen (Int. J. Comput. Math., 2025)

An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs. - Yaping Deng; Peiping Shen (Comput. Appl. Math., 2025)

A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework. - Yanzhen Zhang; Peiping Shen (J. Appl. Math. Comput., 2025)

An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule. - Bingdi Huang; Peiping Shen (Comput. Optim. Appl., 2025)