This paper presents an overview of some recent, and significant, progress in the theory of optimization problems with perturbations. We put the emphasis on methods based on upper and lower estimates of the objective function of the perturbed problems. These methods allow one to compute expansions of the optimal value function and approximate optimal solutions in situations where the set of Lagr...

We discuss several classes of linear second order initial-boundary value problems, where damping terms appear in the main wave equation as well as in the dynamic boundary condition. We investigate their wellposedness and describe some qualitative properties of their solutions, including boundedness, stability, or almost periodicity. In particular, we are able to characterize the analyticity of ...

For the complete higher order differential equation u(t) = Σn−1 k=0Aku (t) + f(t), t ∈ R (*) on a Banach space E, we give a new definition of mild solutions of (*). We then characterize the regular admissibility of a translation invariant subspace M of BUC(R,E) with respect to (*) in terms of solvability of the operator equation Σn−1 j=0AjXD j −XD = C. As application, almost periodicity of mild...

In this paper, we analyze the convergence of the Alternating Direction Method of Multipliers (ADMM) as a matrix recurrence for the particular case of a quadratic program or a linear program. We identify a particular combination of the vector iterates in the standard ADMM iteration that exhibits almost monotonic convergence. We present an analysis which indicates the convergence depends on the e...

Game-theoretic algorithms for the protection of critical infrastructure sites have been widely deployed in recent years. Important sites are protected by multiple agencies that assign their resources almost independently; but limited coordination has been shown to result in significant inefficiencies. Encouraging these agencies to coordinate requires developing mechanisms that can assign their ...

This paper completes the proof of the Lp-boundedness of bilinear operators associated to nonsmooth symbols or multipliers begun in Part I, our companion paper [8], by establishing the corresponding Lp-boundedness of time-frequency paraproducts associated with tiles in phase plane. The affine invariant structure of such operators in conjunction with the geometric properties of the associated pha...

This paper presents a new bit-parallel multiplier for the finite field GF (2) generated with an irreducible all-one polynomial. Redundant representation is used to reduce the time delay of the proposed multiplier, while a three-term Karatsuba-like formula is combined with this representation to decrease the space complexity. As a result, the proposed multiplier requires about 10 percent fewer A...

This paper propose an efficient algorithm for multipliers modulo . To achieve high speed, the Wallace tree is adopted for the multipliers. The proposed Wallace tree multipliers exhibit much more resular structure than binary Wallace tree cultipliers. Comparison with a previous counterpart shows favorable to our multiplier in both speed and hardware..

We present a novel approach for computing 2n-bit Montgomery multiplications with n-bit hardware Montgomery multipliers. Smartcards are usually equipped with such hardware Montgomery multipliers; however, due to progresses in factoring algorithms, the recommended bit length of public-key schemes such as RSA is steadily increasing, making the hardware quickly obsolete. Thanks to our doublesize te...

In this paper fast pipelined digit-serial/parallel multipliers are proposed. The conventional digit-serial/parallel multipliers and their pipelined versions are presented. Every structure has been implemented on FPGA and the results are given. These results have been analysed and it is detected that the pipelined ones do not have the throughput improvement expected because of a logic depth incr...