default search action
Gongyun Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j24]Kali P. Rath, Gongyun Zhao:
The Nature of Equilibria Under Noncollusive Product Design and Collusive Pricing. IGTR 24(2): 2150013:1-2150013:28 (2022)
2010 – 2019
- 2010
- [j23]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): 579-592 (2010) - [j22]Gongyun Zhao:
Representing the space of linear programs as the Grassmann manifold. Math. Program. 121(2): 353-386 (2010)
2000 – 2009
- 2008
- [j21]Fanwen Meng, Gongyun Zhao, Mark Goh
, Robert de Souza:
Lagrangian-Dual Functions and Moreau--Yosida Regularization. SIAM J. Optim. 19(1): 39-61 (2008) - 2007
- [j20]Chee-Khian Sim
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. Math. Program. 110(3): 475-499 (2007) - [j19]John R. Birge
Successive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic Programs. SIAM J. Optim. 18(4): 1165-1186 (2007) - 2006
- [j18]Zheng-Hai Huang, Defeng Sun
A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming. Comput. Optim. Appl. 35(2): 199-237 (2006) - 2005
- [j17]Gongyun Zhao:
A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming. Math. Program. 102(1): 1-24 (2005) - [j16]Chee-Khian Sim
A note on treating a second order cone program as a special case of a semidefinite program. Math. Program. 102(3): 609-613 (2005) - [j15]Fanwen Meng, Defeng Sun
Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization. Math. Program. 104(2-3): 561-581 (2005) - 2004
- [j14]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): 269-283 (2004) - [j13]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): 327-344 (2004) - 2003
- [j12]Kali P. Rath, Gongyun Zhao:
Nonminimal product differentiation as a bargaining outcome. Games Econ. Behav. 42(2): 267-280 (2003) - [j11]Xinwei Liu, Gongyun Zhao:
A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs. SIAM J. Optim. 14(1): 200-222 (2003) - 2002
- [j10]Jie Sun
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. Math. Oper. Res. 27(2): 332-346 (2002) - [j9]Kim-Chuan Toh, Gongyun Zhao, Jie Sun
A Multiple-Cut Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems. SIAM J. Optim. 12(4): 1126-1146 (2002) - 2001
- [j8]Gongyun Zhao:
A Log-Barrier method with Benders decomposition for solving two-stage stochastic linear programs. Math. Program. 90(3): 507-536 (2001)
1990 – 1999
- 1999
- [j7]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): 293-307 (1999) - 1998
- [j6]Jie Sun
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): 123-139 (1998) - [j5]Gongyun Zhao:
Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path. SIAM J. Optim. 8(2): 397-413 (1998) - 1996
- [j4]Gongyun Zhao:
On the Relationship Between the Curvature Integral and the Complexity of Path-Following Methods in Linear Programming. SIAM J. Optim. 6(1): 57-73 (1996) - 1995
- [j3]Gongyun Zhao:
On the choice of parameters for power-series interior point algorithms in linear programming. Math. Program. 68: 49-71 (1995) - [j2]Gongyun Zhao, Jishan Zhu:
The curvature integral and the complexity of linear complementarity problems. Math. Program. 70: 107-122 (1995) - 1991
- [b1]Gongyun Zhao:
Estimating the complexity of path-following methods in linear programming by curvature integrals along the central trajectory. Julius Maximilians University Würzburg, Germany, 1991, pp. 1-54 - [j1]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: 527-553 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: