"A polynomial arc-search interior-point algorithm for convex quadratic ..."

Yaguang Yang (2011)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2011.06.020

access: closed

type: Journal Article

metadata version: 2020-02-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/Yang11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/Yang11
Yaguang Yang:
A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur. J. Oper. Res. 215(1): 25-38 (2011)

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.