Zhao Gongyun

Gongyun Zhao

Information about the author Gongyun Zhao will soon be added to the site.
Found 5 papers in total
Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
2004
Most existing interior-point methods for a linear complementarity problem (LCP)...
An analytic center cutting plane method for semidefinite feasibility problems
An analytic center cutting plane method for semidefinite feasibility problems
2002
Semidefinite feasibility problems arise in many areas of operations research. The...
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
On the rate of local convergence of high-order-infeasible-path-following algorithms for P*-linear complementarity problems
1999
A simple and unified analysis is provided on the rate of local convergence for a class...
The curvature integral nad the complexity of linear complementarity problems
The curvature integral nad the complexity of linear complementarity problems
1995
In this paper, the authors propose a predictor-corrector-type algorithm for solving...
On the choice of parameters for power-series interior point algorithms in linear programming
On the choice of parameters for power-series interior point algorithms in linear programming
1995
In this paper the authors study higher-order interior point algorithms, especially...
Papers per page: