"Iteration complexity analysis of dual first-order methods for conic convex ..."

Ion Necoara, Andrei Patrascu (2016)

> Home

Details and statistics

DOI: 10.1080/10556788.2016.1161763

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/oms/NecoaraP16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/oms/NecoaraP16
Ion Necoara, Andrei Patrascu:
Iteration complexity analysis of dual first-order methods for conic convex programming. Optim. Methods Softw. 31(3): 645-678 (2016)

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.