"On the complexity of approximating a KKT point of quadratic programming."

Yinyu Ye (1998)

> Home

Details and statistics

DOI: 10.1007/BF01581726

access: closed

type: Journal Article

metadata version: 2023-09-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/Ye98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/Ye98
Yinyu Ye:
On the complexity of approximating a KKT point of quadratic programming. Math. Program. 80: 195-211 (1998)

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.