-3/2) for nonconvex optimization.">-3/2) for nonconvex optimization., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">

default search action

combined dblp search
author search
venue search
publication search

ask others

"A trust region algorithm with a worst-case iteration complexity of ..."

Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi (2017)

> Home

Details and statistics

DOI: 10.1007/S10107-016-1026-2

access: closed

type: Journal Article

metadata version: 2017-07-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/CurtisRS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/CurtisRS17
Frank E. Curtis, Daniel P. Robinson, Mohammadreza Samadi:
A trust region algorithm with a worst-case iteration complexity of O(ϵ ^-3/2) for nonconvex optimization. Math. Program. 162(1-2): 1-32 (2017)

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.