Maryam Fazel

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Vincent Roulet

> Home > Persons > Maryam Fazel

Publications

2024
[j23]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/ojmo/RouletSFH24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ojmo/RouletSFH24
Vincent Roulet, Siddhartha S. Srinivasa, Maryam Fazel, Zaïd Harchaoui:
Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates. Open J. Math. Optim. 5: 1-63 (2024)
2022
[i27]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2207-06362
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2207-06362
Vincent Roulet, Siddhartha S. Srinivasa, Maryam Fazel, Zaïd Harchaoui:
Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates. CoRR abs/2207.06362 (2022)
2020
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/amcc/RouletFSH20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/amcc/RouletFSH20
Vincent Roulet, Maryam Fazel, Siddhartha S. Srinivasa, Zaïd Harchaoui:
On the Convergence of the Iterative Linear Exponential Quadratic Gaussian Algorithm to Stationary Points. ACC 2020: 132-137

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.