Skip navigation
IVLE
Email
Library
Map
Calendar
Home
Research Outputs
View research outputs
Deposit publication / dataset
Researchers
Help
FAQs
Contact us
Guidelines
Log in
ScholarBank@NUS
Research Outputs
Browsing by Author
Zhao Gong Yun
Enter a last name
Select a letter below to browse by last name or type
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Or
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Showing results 1 to 20 of 35
next >
Refman
EndNote
Bibtex
RefWorks
Excel
CSV
PDF
Send via email
Issue Date
Title
Author(s)
2004
A decomposition method based on SQP for a class of multistage stochastic nonlinear programs
Liu, X.
;
Zhao, G.
Jan-2005
A lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
Zhao, G.
May-2001
A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
Zhao, G.
2002
A multiple-cut analytic center cutting plane method for semidefinite feasibility problems
Toh, K.-C.
;
Zhao, G.
;
Sun, J.
Apr-2005
A note on treating a second order cone program as a special case of a semidefinite program
SIM CHEE KHIAN
;
Zhao, G.
1997
A predictor-corrector algorithm for a class of nonlinear saddle point problems
Sun, J.
;
Zhu, J.
;
Zhao, G.
2000
A quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problems
Sun, J.
;
Zhao, G.
Oct-2006
A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
Huang, Z.-H.
;
Sun, D.
;
Zhao, G.
Jun-2004
A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programming
Meng, F.
;
Tan, R.C.E.
;
Zhao, G.
Jun-2004
A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programming
Meng, F.
;
Tan, R.C.E.
;
Zhao, G.
2002
An analytic center cutting plane method for semidefinite feasibility problems
Sun, J.
;
Toh, K.-C.
;
Zhao, G.
Nov-2004
Analytic center cutting-plane method with deep cuts for semidefinite feasibility problems
Chua, S.K.
;
Toh, K.C.
;
Zhao, G.Y.
Apr-2008
Asymptotic behavior of Helmberg-Kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theory
SIM CHEE KHIAN
;
Zhao, G.
Oct-2009
Complementarity demand functions and pricing models for multi-product markets
Soon, W.
;
Zhao, G.
;
Zhang, J.
Mar-2004
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems
Zhou, G.
;
Toh, K.-C.
;
Zhao, G.
1998
Global linear and local quadratic convergence of a long-step adaptive-mode interior point method for some monotone variational inequality problems
Sun, J.
;
Zhao, G.
May-1998
Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path
Zhao, G.
Jul-1999
Interior-point methods with decomposition for solving large-scale linear programs
Zhao, G.Y.
2008
Lagrangian-dual functions and Moreau-Yosida regularization
Meng, F.
;
Zhao, G.
;
Goh, M.
;
De Souza, R.
Feb-2003
Nonminimal product differentiation as a bargaining outcome
Rath, K.P.
;
Zhao, G.