"Worst-case complexity of an SQP method for nonlinear equality constrained ..."

Frank E. Curtis, Michael O'Neill, Daniel P. Robinson (2024)

> Home

Details and statistics

DOI: 10.1007/S10107-023-01981-1

access: closed

type: Journal Article

metadata version: 2024-05-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/CurtisOR24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/CurtisOR24
Frank E. Curtis, Michael O'Neill, Daniel P. Robinson:
Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization. Math. Program. 205(1): 431-483 (2024)

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.