SIAM Journal on Control Template
Write in a clean editor, then format for SIAM Journal on Control in one click — DocuGuru applies the official SIAM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
About the SIAM Journal on Control format
SIAM Journal on Control is a peer-reviewed journal published by SIAM, covering Optimization and Variational Analysis, Stability and Controllability of Differential Equations, Stability and Control of Uncertain Systems.
| Publisher | SIAM |
|---|---|
| Reference style | Numbered (SIAM) Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, SIAM Journal on Control 12 (2023) 45–58.
Formats any DOI in the closest standard style — SIAM Journal on Control has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Optimization and Variational Analysis Stability and Controllability of Differential Equations Stability and Control of Uncertain Systems Advanced Optimization Algorithms Research Aerospace Engineering and Control Systems |
| ISSN | 0036-1402 |
| h-index | 96 |
| i10-index | 366 |
| Total citations | 32,200 |
| Top institutions publishing here | University of California, Berkeley |
| Journal website | epubs.siam.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Papers published in SIAM Journal on Control per year
Citation impact of SIAM Journal on Control by publication year
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Most-cited papers in SIAM Journal on Control
It is sometimes conjectured that nothing is to be gained by using non-linear controllers when the objective is to minimize the expectation of a quadratic criterion for a linear system subject to Gaussian noise and with unconstrained control variables. In fact, this statement has only been established for the case where all control variables are…
A minimal basis of a vector space V of n-tuples of rational functions is defined as a polynomial basis such that the sum of the degrees of the basis n-tuples is minimum. Conditions for a matrix G to represent a minimal basis are derived. By imposing additional conditions on G we arrive at a minimal…
If a nonlinear programming problem is analyzed in terms of its ordinary Lagrangian function, there is usually a duality gap, unless the objective and constraint functions are convex. It is shown here that the gap can be removed by passing to an augmented Lagrangian which involves quadratic penalty-like terms. The modified dual problem then consists…