Gongyun Zhao

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