"Iteration complexity of an interior-point algorithm for nonlinear ..."

Yunbin Zhao, Jiye Han, Zengzhu Xu (1999)

> Home

Details and statistics

DOI: 10.1080/00207169908804783

access: closed

type: Journal Article

metadata version: 2019-05-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcm/ZhaoHX99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/ZhaoHX99
Yunbin Zhao, Jiye Han, Zengzhu Xu:
Iteration complexity of an interior-point algorithm for nonlinear p-complementarity problems. Int. J. Comput. Math. 70(4): 699-715 (1999)

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.