On the complexity of following the central path of linear programs by linear extrapolation II. - György Sonnevend; Josef Stoer; Gongyun Zhao (Math. Program., 1991)

Estimating the complexity of path-following methods in linear programming by curvature integrals along the central trajectory. - Gongyun Zhao (1991)

On the choice of parameters for power-series interior point algorithms in linear programming. - Gongyun Zhao (Math. Program., 1995)

The curvature integral and the complexity of linear complementarity problems. - Gongyun Zhao; Jishan Zhu (Math. Program., 1995)

On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming. - Gongyun Zhao (SIAM J. Optim., 1996)

Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems. - Jie Sun 001; Gongyun Zhao (SIAM J. Optim., 1998)

Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path. - Gongyun Zhao (SIAM J. Optim., 1998)

On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity Problems. - Gongyun Zhao; Jie Sun 001 (Comput. Optim. Appl., 1999)

A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs. - Gongyun Zhao (Math. Program., 2001)

An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. - Jie Sun 001; Kim-Chuan Toh; Gongyun Zhao (Math. Oper. Res., 2002)

A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. - Kim-Chuan Toh; Gongyun Zhao; Jie Sun 001 (SIAM J. Optim., 2002)

Nonminimal product differentiation as a bargaining outcome. - Kali P. Rath; Gongyun Zhao (Games Econ. Behav., 2003)

A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs. - Xinwei Liu; Gongyun Zhao (SIAM J. Optim., 2003)

Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems. - Guanglu Zhou; Kim-Chuan Toh; Gongyun Zhao (Comput. Optim. Appl., 2004)

A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programming. - Fanwen Meng; Roger C. E. Tan; Gongyun Zhao (Int. J. Comput. Eng. Sci., 2004)

Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. - Fanwen Meng; Defeng Sun; Gongyun Zhao (Math. Program., 2005)

A note on treating a second order cone program as a special case of a semidefinite program. - Chee-Khian Sim; Gongyun Zhao (Math. Program., 2005)

A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming. - Gongyun Zhao (Math. Program., 2005)

A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming. - Zheng-Hai Huang; Defeng Sun; Gongyun Zhao (Comput. Optim. Appl., 2006)

Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. - Chee-Khian Sim; Gongyun Zhao (Math. Program., 2007)

Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic Programs. - John R. Birge; Gongyun Zhao (SIAM J. Optim., 2007)

Lagrangian-Dual Functions and Moreau–Yosida Regularization. - Fanwen Meng; Gongyun Zhao; Mark Goh; Robert de Souza (SIAM J. Optim., 2008)

On the implementation of a log-barrier progressive hedging method for multistage stochastic programs. - Xinwei Liu; Kim-Chuan Toh; Gongyun Zhao (J. Comput. Appl. Math., 2010)

Representing the space of linear programs as the Grassmann manifold. - Gongyun Zhao (Math. Program., 2010)

The Nature of Equilibria Under Noncollusive Product Design and Collusive Pricing. - Kali P. Rath; Gongyun Zhao (IGTR, 2022)