"On the complexity analysis of a Mehrotra-type primal-dual feasible ..."

Mohammad H. Koulaei, Tamás Terlaky (2010)

> Home

Details and statistics

DOI: 10.1080/10556780802571392

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/KoulaeiT10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/oms/KoulaeiT10
Mohammad H. Koulaei, Tamás Terlaky:
On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. Optim. Methods Softw. 25(3): 467-485 (2010)

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.