In this paper, we present a predictor-corrector path-following interior-point algorithm for symmetric cone optimization based on Darvay's technique. Each iteration of the algorithm contains a predictor step and a corrector step based on a modification of the Nesterov and Todd directions. Moreover, we show that the algorithm is well defined and that the obtained iteration bound is √ log , where ...

In this paper a nonlinear frequency domain adaptive regularized iterative image restoration algorithm is proposed, according to which the regularization parameter is frequency dependent and is updated at each iteration step. The development of the algorithm is based on a set theoretic regularization approach, where bounds on the error residual and the stabilizing functional are updated in the f...

Atmospheric tomography is a prerequisite step before wavefront perturbations can be corrected in Multi Conjucate Adaptive Optics (MCAO) systems. Recently, the use of a Landweber-Kaczmarz iteration has been proposed to solve the tomography problem. However, due to the geometric partitioning of the update steps in this method, discontinuities in the solution appear that are physically implausible...

Alireza Avanaki [email protected] (my ID is my last name) Abstract The SSIM-optimized exact global histogram specification (EGHS) is shown to converge in the sense that the first order approximation of the result’s quality (i.e., its structural similarity with input) does not decrease in an iteration, when the step size is small. Each iteration is composed of SSIM gradient ascent and basic EGHS wi...

story has long been exploited to transfer human culture and concepts. it is the most consistent verbal form to the human mind. therefore, its audience spectrum is more widespread and its influence power is higher. though the qur'an's main language is the language of religion and spiritual guidance, it exploits the storytelling method in its complete form to disseminate its message.  u...

In each iteration of an interior-point method for semideenite programming, the maximum step-length that can be taken by the iterate while maintaining the positive semideeniteness constraint need to be estimated. In this note, we show how the maximum step-length can be estimated via the Lanczos iteration, a standard iterative method for estimating the extremal eigenvalues of a matrix. We also gi...

In this paper we present a novel method for solving optimization problems governed by partial di erential equations. Existing methods use gradient information in marching toward the minimum, where the constrained PDE is solved once (sometimes only approximately) per each optimization step. Such methods can be viewed as a marching techniques on the intersection of the state and costate hypersurf...

Notions of guardedness serve to delineate admissible recursive definitions in various settings a compositional manner. In recent work, we have introduced an axiomatic notion symmetric monoidal categories, which serves as unifying framework for examples from program semantics, process algebra, and beyond. the present paper, propose generic metalanguage guarded iteration based on combining this w...

The EM algorithm is a popular and useful algorithm for "nding the maximum likelihood estimator in incomplete data problems. Each iteration of the algorithm consists of two simple steps: an E-step, in which a conditional expectation is calculated, and an M-step, where the expectation is maximized. In some problems, however, the EM algorithm cannot be applied since the conditional expectation req...

In this paper a regularized version of the”extraproximal method” is suggested to be applied for finding a Nash equilibrium in a multi­participant finite game where the dynamics of each player is governed by a finite controllable Markov chain. The suggested iterative technique realizes the application of a two­step procedure at each iteration: at the first (or preliminary) step some ”predictive ...