Liang Fang

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Zengzhe Feng

> Home > Persons > Liang Fang

Publications

2014
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jcam/FengF14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcam/FengF14
Zengzhe Feng, Liang Fang:
A new O(sqrt(n)L)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming. J. Comput. Appl. Math. 256: 65-76 (2014)
2010
[c18]
- view
  authority control:
- export record
  dblp key:
  - conf/isnn/FangHFW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isnn/FangHFW10
Liang Fang, Guoping He, Zengzhe Feng, Yongli Wang:
A Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming. ISNN (1) 2010: 102-109
2009
[c12]
- view
  authority control:
- export record
  dblp key:
  - conf/icnc/FengF09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icnc/FengF09
Zengzhe Feng, Liang Fang:
A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming. ICNC (6) 2009: 293-298
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/icnc/FangHFH09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icnc/FangHFH09
Liang Fang, Yunhong Hu, Zengzhe Feng, Guoping He:
A Non-interior Point Continuation Algorithm Based on Orthogonal Projection for Second-Order Cone Programming. ICNC (3) 2009: 481-485

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.