Basics of Bayesian statistics in inverse problems using the maximum entropy principle are summarized in connection with the restoration of positive, additive images from various types of data like X-ray digital mammograms. An efficient iterative algorithm for image restoration from large data sets based on the conjugate gradient method and Lagrange multipliers in nonlinear optimization of a spe...

This work presents a method to find the exact solutions for the free vibration analysis of a delaminated beam based on the Timoshenko type with different boundary conditions. The solutions are obtained by the method of Lagrange multipliers in which the free vibration problem is posed as a constrained variational problem. The Legendre orthogonal polynomials are used as the beam eigenfunctions. N...

Two popular non-overlapping domain decomposition methods, the FETI–DP and BDDC algorithms, are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal conti...

The paper deals with a general optimal control problem for age-structured systems. A necessary optimality condition of Pontryagin type is obtained, where the novelty is in that mixed control-state constraints are present. The proof uses an abstract Lagrange multiplier theorem, and the main difficulty is to obtain regularity of the Lagrange multipliers in the particular problem at hand.

in this paper, the variational iteration method proposed by ji-huan he is applied to solve both linear and nonlinear schrodinger equations. the main property of the method is in its flexibility and ability to solve linear and nonlinear equations accurately and conveniently. in this method, general lagrange multipliers are introduced to construct correction functionals to the problems. the multi...

The design of software-based algorithms for fast IP address lookup targeted for general purpose processors has received tremendous attention in recent years due to its low cost implementation and flexibility. However, all work to date fails to account for the hierarchical memory structure of the processor when designing algorithms. In this work, we propose a dynamic memory model that captures d...

In this paper we present a method called NOVEL (Nonlinear Optimization via External Lead) for solving continuous and discrete global optimization problems. NOVEL addresses the balance between global search and local search, using a trace to aid in identifying promising regions before committing to local searches. We discuss NOVEL for solving continuous constrained optimization problems and show...

Every day almost everyone has to plan or organize some activity by using different resources time, money, etc. It is even more important for managers that often are in a continuous process of decision making. Most managers rely mainly on their experience and intuition, rather than on strict mathematical models and optimization methods. With advances in the computer industry, it is becoming fa...

We consider the so-called Babuska method of finite elements with Lagrange multipliers for numerically solving the problem Au = f in il, u = g on 3Í2, iî C Rn, 7i > 2. We state a number of local conditions from which we prove the uniform stability of the Lagrange multiplier method in terms of a weighted, mesh-dependent norm. The stability conditions given weaken the conditions known so far and a...