Gongyun Zhao

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 1

Julius Maximilians University Würzburg, Germany (PHD)

Education History

Julius Maximilians University Würzburg, Germany

PHD

Publications

Kali P. Rath, Gongyun Zhao
The Nature of Equilibria Under Noncollusive Product Design and Collusive Pricing. IGTR 24 (2) (2022)
Xinwei Liu, Kim-Chuan Toh, Gongyun Zhao
On the implementation of a log-barrier progressive hedging method for multistage stochastic programs. J. Comput. Appl. Math. 234 (2) (2010)
Gongyun Zhao
Representing the space of linear programs as the Grassmann manifold. Math. Program. 121 (2) (2010)
Fanwen Meng, Gongyun Zhao, Mark Goh, Robert de Souza
Lagrangian-Dual Functions and Moreau--Yosida Regularization. SIAM J. Optim. 19 (1) (2008)
Chee-Khian Sim, Gongyun Zhao
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. Math. Program. 110 (3) (2007)
John R. Birge, Gongyun Zhao
Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic Programs. SIAM J. Optim. 18 (4) (2007)
Zheng-Hai Huang, Defeng Sun, Gongyun Zhao
A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming. Comput. Optim. Appl. 35 (2) (2006)
Fanwen Meng, Defeng Sun, Gongyun Zhao
Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Program. 104 (2-3) (2005)
Chee-Khian Sim, Gongyun Zhao
A note on treating a second order cone program as a special case of a semidefinite program. Math. Program. 102 (3) (2005)
Gongyun Zhao
A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming. Math. Program. 102 (1) (2005)
Fanwen Meng, Roger C. E. Tan, Gongyun Zhao
A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programming. Int. J. Comput. Eng. Sci. 5 (2) (2004)
Guanglu Zhou, Kim-Chuan Toh, Gongyun Zhao
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems. Comput. Optim. Appl. 27 (3) (2004)
Xinwei Liu, Gongyun Zhao
A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs. SIAM J. Optim. 14 (1) (2003)
Kali P. Rath, Gongyun Zhao
Nonminimal product differentiation as a bargaining outcome. Games Econ. Behav. 42 (2) (2003)
Jie Sun, Kim-Chuan Toh, Gongyun Zhao
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. Math. Oper. Res. 27 (2) (2002)
Kim-Chuan Toh, Gongyun Zhao, Jie Sun
A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. SIAM J. Optim. 12 (4) (2002)
Gongyun Zhao
A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs. Math. Program. 90 (3) (2001)
Gongyun Zhao, Jie Sun
On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity Problems. Comput. Optim. Appl. 14 (3) (1999)
Jie Sun, Gongyun Zhao
Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems. SIAM J. Optim. 8 (1) (1998)
Gongyun Zhao
Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path. SIAM J. Optim. 8 (2) (1998)
Gongyun Zhao
On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming. SIAM J. Optim. 6 (1) (1996)
Gongyun Zhao, Jishan Zhu
The curvature integral and the complexity of linear complementarity problems. Math. Program. 70 (1995)
Gongyun Zhao
On the choice of parameters for power-series interior point algorithms in linear programming. Math. Program. 68 (1995)
György Sonnevend, Josef Stoer, Gongyun Zhao
On the complexity of following the central path of linear programs by linear extrapolation II. Math. Program. 52 (1991)

Gongyun Zhao.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Gongyun Zhao