Shih-Ping Han - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2010

A Note on the Connection Between the Primal-Dual and the A* AlgorithmXugang Ye, Shih-Ping Han, Anhua Lin. ijoris, 1(1):73-85, 2010. [doi]

2004

A Class of Methods for Projection on the Intersection of Several EllipsoidsAnhua Lin, Shih-Ping Han. siamjo, 15(1):129-138, 2004. [doi]

2002

On the Distance between Two EllipsoidsAnhua Lin, Shih-Ping Han. siamjo, 13(1):298-308, 2002. [doi]

1992

Globally Convergent Newton Methods for Nonsmooth EquationsShih-Ping Han, Jong-Shi Pang, Narayan Rangaraj. mor, 17(3):586-607, 1992. [doi]

1991

Minimization of Locally Lipschitzian FunctionsJong-Shi Pang, Shih-Ping Han, Narayan Rangaraj. siamjo, 1(1):57-82, 1991. [doi]

1989

A Decomposition Method and Its Application to Convex ProgrammingShih-Ping Han. mor, 14(2):237-248, 1989. [doi]

1988

A successive projection methodShih-Ping Han. mp, 40(1-3):1-14, 1988. [doi]

1983

A dual differentiable exact penalty functionShih-Ping Han, Olvi L. Mangasarian. mp, 25(3):293-306, 1983. [doi]

1981

Variable metric methods for minimizing a class of nondifferentiable functionsShih-Ping Han. mp, 20(1):1-13, 1981. [doi]

1979

Exact penalty functions in nonlinear programmingShih-Ping Han, Olvi L. Mangasarian. mp, 17(1):251-269, 1979. [doi]

Penalty Lagrangian Methods Via a Quasi-Newton ApproachShih-Ping Han. mor, 4(3):291-302, 1979. [doi]

1976

Superlinearly convergent variable metric algorithms for general nonlinear programming problemsShih-Ping Han. mp, 11(1):263-282, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL