In this paper we improve on some results of 3] and extend them to the setting of implicit deenability. We show a strong necessary condition on classes of structures on which PSPACE can be captured by extending PFP with a nite set of generalized quantiiers. For IFP and PTIME the limitation of expressive power of generalized quantiiers is shown only on some speciic nontrivial classes. These resul...

Abstract. We consider the problem of computing optimal tra c light programs for urban road intersections using tra c flow conservation laws on networks. Based on a Partial Outer Convexification approach, which has been successfully applied in the area of mixed-integer optimal control for systems of ordinary or di↵erential algebraic equations, we develop a computationally tractable two-stage sol...

The photovoltaic (PV) system exhibits a nonlinear current-voltage (I-V) characteristic that its maximum power point (MPP) varies with solar insolation and temperature. In this paper, a maximum power point tracking (MPPT) method using fuzzy logic control (FLC) is presented. This method is based on the concept of perturbation and observation (P & O) algorithm to track the MPP. The two stage grid ...

After an introduction to main ideas of semi-infinite optimization, this article surveys recent developments in theory and numerical methods for standard and generalized semi-infinite optimization problems. Particular attention is paid to connections with mathematical programs with complementarity constraints, lower level Wolfe duality, semi-smooth approaches, as well as branch and bound techniq...

We prove the bulk universality of the β-ensembles with non-convex regular analytic potentials for any β > 0. This removes the convexity assumption appeared in the earlier work [6]. The convexity condition enabled us to use the logarithmic Sobolev inequality to estimate events with small probability. The new idea is to introduce a “convexified measure” so that the local statistics are preserved ...

The paper addresses the fault detection (FD) problem for a class of discrete-time Markov jump linear systems (MJLSs) with deficient transition rates, which simultaneously considers the totally known, partly unknown, and uncertain transition rates. Then, in accordance with the linear matrix inequality (LMI) method and the convexification techniques, a sufficient condition for the existence of FD...

We have a set S ⊂ {0,1}n, together with, for each x ∈ S, the result of some unknown function F : {0,1}n → {0,1} applied to x, and a method for generating a hypothesis h ∈ H about F given S. We present theoretical and experimental results on four possible methods (similarity, convexification, prevalence and Hamming distance) for determing, given two elements y,z ∈ {0,1}n\S, whether we should be ...

We propose the moment cone relaxation for a class of polynomial optimization problems (POPs) to extend the results on the completely positive cone programming relaxation for the quadratic optimization (QOP) model by Arima, Kim and Kojima. The moment cone relaxation is constructed to take advantage of sparsity of the POPs, so that efficient numerical methods can be developed in the future. We es...