We show that the quadratic growth condition and the Mangasarian-Fromovitz constraint qualiication imply that local minima of nonlinear programs are isolated stationary points. As a result, when started suuciently close to such points, an L1 exact penalty sequential quadratic programming algorithm will induce at least R-linear convergence of the iterates to such a local minimum. We construct an ...

Satisfiability problem for modal logic K with quantifier-free Presburger and regularity constraints (EML) is known to be pspace-complete. In this paper, we consider its extension with nonregular constraints, and more specifically those expressed by visibly pushdown languages (VPL). This class of languages behaves nicely, in particular when combined with Propositional Dynamic Logic (PDL). By ext...

This paper presents a general model for temporal reasoning, capable of handling both qualita tive and quantitative information. This model allows the representation and processing of all types of constraints considered in the literature so far, including metric constraints (restricting the distance between time points), and qualitative, disjunctive, constraints (specifying the relative position...

This paper deals with the sliding-contact constraint equations describing the relative motion of two freeform surfaces, assuming that the surfaces can have arbitrary curvature in 3D space. The sliding-contact equations are developed either for the non-penetration condition and for the surface-tangency condition. Both are differentiated twice in time in order to allow a straightforward applicati...

In this paper, we address the semi-supervised learning problem when there is a small amount of labeled data augmented with pairwise constraints indicating whether a pair of examples belongs to a same class or different classes. We introduce a discriminative learning approach that incorporates pairwise constraints into the conventional margin-based learning framework. We also present an efficien...

Satisfiability problem for modal logic K with quantifier-free Presburger and regularity constraints (EML) is known to be pspace-complete. In this paper, we consider its extension with nonregular constraints, and more specifically those expressed by visibly pushdown languages (VPL). This class of languages behaves nicely, in particular when combined with Propositional Dynamic Logic (PDL). By ext...

This paper is concerned with the variance-constrained state estimation problem for a class of networked multi-rate systems (NMSs) with network-induced probabilistic sensor failures and measurement quantization. The stochastic characteristics of the sensor failures are governed by mutually independent random variables over the interval [0, 1]. By applying the lifting technique, an augmented syst...