A numerical method is proposed for optimal robust control synthesis. The method applies to the case when the coefficients of the characteristic polynomial depend linearly on the uncertain parameters. A primal/dual pair of infinite-dimensional convex problems is solved by successive finite-dimensional approximations. The primal/dual pair has no duality gap, and both upper and lower bounds produc...

In this paper, we propose a successive approximation method based on fuzzy wavelet like operator to approximate the solution of linear fuzzy Fredholm integral equations of the second kind with arbitrary kernels. We give the convergence conditions and an error estimate. Also, we investigate the numerical stability of the computed values with respect to small perturbations in the first iteration....

In this paper, we consider fractional differential equations with the new derivative involving a nonsingular kernel, namely, Caputo-Fabrizio derivative. Using successive approximation method, prove an extension of Picard-Lindelöf existence and uniqueness theorem for derivative, which gives set conditions, under initial value problem has unique solution.

We propose a differentiable successive halving method of relaxing the top-k operator, rendering gradient-based optimization possible. The need to perform softmax iteratively on entire vector scores is avoided using tournament-style selection. As result, much better approximation and lower computational cost achieved compared previous approach.

The weak Neumann problem for the Poisson eqution is studied on Lipschitz domain with compact boundary using the direct integral equation method. The domain is bounded or unbounded, the boundary might be disconnected. The problem leads to a uniquely solvable integral equation in H(∂Ω). It is proved that we can get the solution of this equation using the successive approximation method. AMS class...

Although the lift-and-project operators of Lovász and Schrijver have been the subject of intense study, their M(K , K ) operator has received little attention. We consider an application of this operator to the stable set problem. We begin with an initial linear programming (LP) relaxation consisting of clique and non-negativity inequalities, and then apply the operator to obtain a stronger ext...

Network community detection—the problem of dividing a network of interest into clusters for intelligent analysis—has recently attracted significant attention in diverse fields of research. To discover intrinsic community structure a quantitative measure called modularity has been widely adopted as an optimization objective. Unfortunately, modularity is inherently NP-hard to optimize and approxi...

Ahstract In this paper it is assumed that the point (or block) Jacobi manix. B associated with the matrix A is weakly 2-cyclic consistently ordered with complex, in general, eigen-value spectrum, a(B), lying in the interior of the infinite unit strip. It is then our objec~ live to apply and ex.tend the Young-Eidson algorithm in order to determine the real optimum relaxation factor in the follow...