scispace - formally typeset

JournalISSN: 0363-0129

Siam Journal on Control and Optimization 

About: Siam Journal on Control and Optimization is an academic journal. The journal publishes majorly in the area(s): Optimal control & Controllability. It has an ISSN identifier of 0363-0129. Over the lifetime, 4781 publication(s) have been published receiving 228629 citation(s).
More filters

Journal ArticleDOI
Peter J. Ramadge1, W. M. Wonham1Institutions (1)
Abstract: This paper studies the control of a class of discrete event processes, i.e. processes that are discrete, asynchronous and possibly nondeter-ministic. The controlled process is described as the generator of a formal language, while the controller, or supervisor, is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior. The existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language. Two examples are provided.

3,291 citations

Journal ArticleDOI
Sanjay P. Bhat1, Dennis S. BernsteinInstitutions (1)
TL;DR: It is shown that the regularity properties of the Lyapunov function and those of the settling-time function are related and converse Lyap Unov results can only assure the existence of continuous Lyap unov functions.
Abstract: Finite-time stability is defined for equilibria of continuous but non-Lipschitzian autonomous systems. Continuity, Lipschitz continuity, and Holder continuity of the settling-time function are studied and illustrated with several examples. Lyapunov and converse Lyapunov results involving scalar differential inequalities are given for finite-time stability. It is shown that the regularity properties of the Lyapunov function and those of the settling-time function are related. Consequently, converse Lyapunov results can only assure the existence of continuous Lyapunov functions. Finally, the sensitivity of finite-time-stable systems to perturbations is investigated.

3,009 citations

Journal ArticleDOI
Abstract: For the problem of minimizing a lower semicontinuous proper convex function f on a Hilbert space, the proximal point algorithm in exact form generates a sequence $\{ z^k \} $ by taking $z^{k + 1} $ to be the minimizes of $f(z) + ({1 / {2c_k }})\| {z - z^k } \|^2 $, where $c_k > 0$. This algorithm is of interest for several reasons, but especially because of its role in certain computational methods based on duality, such as the Hestenes-Powell method of multipliers in nonlinear programming. It is investigated here in a more general form where the requirement for exact minimization at each iteration is weakened, and the subdifferential $\partial f$ is replaced by an arbitrary maximal monotone operator T. Convergence is established under several criteria amenable to implementation. The rate of convergence is shown to be “typically” linear with an arbitrarily good modulus if $c_k $ stays large enough, in fact superlinear if $c_k \to \infty $. The case of $T = \partial f$ is treated in extra detail. Applicati...

2,873 citations

Journal Article
Abstract: The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and collaborative filtering. Although specific instances can often be solved with specialized algorithms, the general affine rank minimization problem is NP-hard because it contains vector cardinality minimization as a special case. In this paper, we show that if a certain restricted isometry property holds for the linear transformation defining the constraints, the minimum-rank solution can be recovered by solving a convex optimization problem, namely, the minimization of the nuclear norm over the given affine space. We present several random ensembles of equations where the restricted isometry property holds with overwhelming probability, provided the codimension of the subspace is sufficiently large. The techniques used in our analysis have strong parallels in the compressed sensing framework. We discuss how affine rank minimization generalizes this preexisting concept and outline a dictionary relating concepts from cardinality minimization to those of rank minimization. We also discuss several algorithmic approaches to minimizing the nuclear norm and illustrate our results with numerical examples.

2,742 citations

Journal Article
TL;DR: The Julia programming language and its design is introduced---a dance between specialization and abstraction, which recognizes what remains the same after computation, and which is best left untouched as they have been built by the experts.

1,730 citations

Network Information
Related Journals (5)
Systems & Control Letters

4.9K papers, 197.9K citations

91% related

11.8K papers, 759.5K citations

90% related
IEEE Transactions on Automatic Control

19.4K papers, 1.2M citations

88% related
International Journal of Control

10.3K papers, 255.6K citations

86% related
Journal of Differential Equations

10.9K papers, 301.4K citations

86% related
No. of papers from the Journal in previous years