Gongyun Zhao - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2022

The Nature of Equilibria Under Noncollusive Product Design and Collusive PricingKali P. Rath, Gongyun Zhao. igtr, 24(2), 2022. [doi]

2010

On the implementation of a log-barrier progressive hedging method for multistage stochastic programsXinwei Liu, Kim-Chuan Toh, Gongyun Zhao. jcam, 234(2):579-592, 2010. [doi]

Representing the space of linear programs as the Grassmann manifoldGongyun Zhao. mp, 121(2):353-386, 2010. [doi]

2008

Lagrangian-Dual Functions and Moreau--Yosida RegularizationFanwen Meng, Gongyun Zhao, Mark Goh, Robert de Souza. siamjo, 19(1):39-61, 2008. [doi]

2007

Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic ProgramsJohn R. Birge, Gongyun Zhao. siamjo, 18(4):1165-1186, 2007. [doi]

Underlying paths in interior point methods for the monotone semidefinite linear complementarity problemChee-Khian Sim, Gongyun Zhao. mp, 110(3):475-499, 2007. [doi]

2006

A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic ProgrammingZheng-Hai Huang, Defeng Sun, Gongyun Zhao. coap, 35(2):199-237, 2006. [doi]

2005

Semismoothness of solutions to generalized equations and the Moreau-Yosida regularizationFanwen Meng, Defeng Sun, Gongyun Zhao. mp, 104(2-3):561-581, 2005. [doi]

A note on treating a second order cone program as a special case of a semidefinite programChee-Khian Sim, Gongyun Zhao. mp, 102(3):609-613, 2005. [doi]

A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex ProgrammingGongyun Zhao. mp, 102(1):1-24, 2005. [doi]

2004

A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programmingFanwen Meng, Roger C. E. Tan, Gongyun Zhao. ijces, 5(2):327-344, 2004. [doi]

Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity ProblemsGuanglu Zhou, Kim-Chuan Toh, Gongyun Zhao. coap, 27(3):269-283, 2004. [doi]

2003

A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear ProgramsXinwei Liu, Gongyun Zhao. siamjo, 14(1):200-222, 2003. [doi]

Nonminimal product differentiation as a bargaining outcomeKali P. Rath, Gongyun Zhao. geb, 42(2):267-280, 2003. [doi]

2002

An Analytic Center Cutting Plane Method for Semidefinite Feasibility ProblemsJie Sun, Kim-Chuan Toh, Gongyun Zhao. mor, 27(2):332-346, 2002. [doi]

A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility ProblemsKim-Chuan Toh, Gongyun Zhao, Jie Sun. siamjo, 12(4):1126-1146, 2002. [doi]

2001

A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programsGongyun Zhao. mp, 90(3):507-536, 2001. [doi]

1999

On the Rate of Local Convergence of High-Order-Infeasible-Path-Following Algorithms for P*-Linear Complementarity ProblemsGongyun Zhao, Jie Sun 0001. coap, 14(3):293-307, 1999. [doi]

1998

Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality ProblemsJie Sun 0001, Gongyun Zhao. siamjo, 8(1):123-139, 1998. [doi]

Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central PathGongyun Zhao. siamjo, 8(2):397-413, 1998. [doi]

1996

On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear ProgrammingGongyun Zhao. siamjo, 6(1):57-73, 1996. [doi]

1995

On the choice of parameters for power-series interior point algorithms in linear programmingGongyun Zhao. mp, 68:49-71, 1995.

The curvature integral and the complexity of linear complementarity problemsGongyun Zhao, Jishan Zhu. mp, 70:107-122, 1995. [doi]

1991

Estimating the complexity of path-following methods in linear programming by curvature integrals along the central trajectoryGongyun Zhao. PhD thesis, Julius Maximilians University Würzburg, Germany, 1991. [doi]

Sign in or sign up to see more results.

runs on WebDSL