1. ScholarBank@NUS
  2. Research Outputs

Browsing by Author Zhao Gong Yun

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


Showing results 1 to 20 of 35  next >
Issue DateTitleAuthor(s)
2004A decomposition method based on SQP for a class of multistage stochastic nonlinear programsLiu, X. ; Zhao, G. 
Jan-2005A lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programmingZhao, G. 
May-2001A log-barrier method with Benders decomposition for solving two-stage stochastic linear programsZhao, G. 
2002A multiple-cut analytic center cutting plane method for semidefinite feasibility problemsToh, K.-C. ; Zhao, G. ; Sun, J. 
Apr-2005A note on treating a second order cone program as a special case of a semidefinite programSIM CHEE KHIAN ; Zhao, G. 
1997A predictor-corrector algorithm for a class of nonlinear saddle point problemsSun, J. ; Zhu, J.; Zhao, G. 
2000A quadratically convergent polynomial long-step algorithm for a class of nonlinear monotone complementarity problemsSun, J. ; Zhao, G. 
Oct-2006A smoothing newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programmingHuang, Z.-H.; Sun, D. ; Zhao, G. 
Jun-2004A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programmingMeng, F. ; Tan, R.C.E. ; Zhao, G. 
Jun-2004A superlinearly convergent algorithm for large scale multi-stage stochastic nonlinear programmingMeng, F. ; Tan, R.C.E. ; Zhao, G. 
2002An analytic center cutting plane method for semidefinite feasibility problemsSun, J. ; Toh, K.-C. ; Zhao, G. 
Nov-2004Analytic center cutting-plane method with deep cuts for semidefinite feasibility problemsChua, S.K. ; Toh, K.C. ; Zhao, G.Y. 
Apr-2008Asymptotic behavior of Helmberg-Kojima-Monteiro (HKM) paths in interior-point methods for monotone semidefinite linear complementarity problems: General theorySIM CHEE KHIAN ; Zhao, G. 
Oct-2009Complementarity demand functions and pricing models for multi-product marketsSoon, W.; Zhao, G. ; Zhang, J.
Mar-2004Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity ProblemsZhou, G.; Toh, K.-C. ; Zhao, G. 
1998Global linear and local quadratic convergence of a long-step adaptive-mode interior point method for some monotone variational inequality problemsSun, J. ; Zhao, G. 
May-1998Interior point algorithms for linear complementarity problems based on large neighborhoods of the central pathZhao, G. 
Jul-1999Interior-point methods with decomposition for solving large-scale linear programsZhao, G.Y. 
2008Lagrangian-dual functions and Moreau-Yosida regularizationMeng, F.; Zhao, G. ; Goh, M. ; De Souza, R.
Feb-2003Nonminimal product differentiation as a bargaining outcomeRath, K.P.; Zhao, G. 
Showing results 1 to 20 of 35  next >