Superlinearly convergent variable metric algorithms for general nonlinear programming problems. - Shih-Ping Han (Math. Program., 1976)

Penalty Lagrangian Methods Via a Quasi-Newton Approach. - Shih-Ping Han (Math. Oper. Res., 1979)

Exact penalty functions in nonlinear programming. - Shih-Ping Han; Olvi L. Mangasarian (Math. Program., 1979)

Variable metric methods for minimizing a class of nondifferentiable functions. - Shih-Ping Han (Math. Program., 1981)

A dual differentiable exact penalty function. - Shih-Ping Han; Olvi L. Mangasarian (Math. Program., 1983)

A successive projection method. - Shih-Ping Han (Math. Program., 1988)

A Decomposition Method and Its Application to Convex Programming. - Shih-Ping Han (Math. Oper. Res., 1989)

A robust sequential quadratic programming method. - James V. Burke; Shih-Ping Han (Math. Program., 1989)

Minimization of Locally Lipschitzian Functions. - Jong-Shi Pang; Shih-Ping Han; Narayan Rangaraj (SIAM J. Optim., 1991)

Globally Convergent Newton Methods for Nonsmooth Equations. - Shih-Ping Han; Jong-Shi Pang; Narayan Rangaraj (Math. Oper. Res., 1992)

On the Distance between Two Ellipsoids. - Anhua Lin; Shih-Ping Han (SIAM J. Optim., 2002)

A Class of Methods for Projection on the Intersection of Several Ellipsoids. - Anhua Lin; Shih-Ping Han (SIAM J. Optim., 2004)

A Note on the Connection Between the Primal-Dual and the A* Algorithm. - Xugang Ye; Shih-Ping Han; Anhua Lin (Int. J. Oper. Res. Inf. Syst., 2010)