introduction: the process of discriminating among benign and malignant hyperplasia begun with subjective methods using light microscopy and is now being continued with computerized morphometrical analysis requiring some features. one of the main features called volume percentage of stroma (vps) is obtained by calculating the percentage of stroma texture. currently, this feature is calculated by...

We analyze alternating descent algorithms for minimizing the sum of a quadratic function and block separable non-smooth functions. In case the quadratic interactions between the blocks are pairwise, we show that the schemes can be accelerated, leading to improved convergence rates with respect to related accelerated parallel proximal descent. As an application we obtain very fast algorithms for...

We consider a generalized proximal point method for solving variational inequalities with maximal monotone operators in a Hilbert space. It proves to be that the conditions on the choice of a non-quadratic distance functional depend on the geometrical properties of the operator in the variational inequality, and – in particular – a standard assumption on the strict convexity of the kernel of th...

A common requirement in optimal control problems arising autonomous navigation is that the decision variables are constrained to be outside certain sets. Such set exclusion constraints represent obstacles must avoided by motion system. This paper presents a simple and efficient method for solving optimization with general implicit constraints. The embeds quadratic penalty framework solves inner...

This paper proposes an innovative algorithm to find the two’s complement of a binary number. The proposed method works in logarithmic time (O(logN)) instead of the worst case linear time (O(N)) where a carry has to ripple all the way from LSB to MSB. The proposed method also allows for more regularly structured logic units which can be easily modularized and can be naturally extended to any wor...

Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...

the improvement in the temporal resolution of seismic data is a critical issue in hydrocarbonexploration. it is important for obtaining more detailed structural and stratigraphic information. manymethods have been introduced to improve the vertical resolution of reflection seismic data. eachmethod has advantages and disadvantages which are due to the assumptions and theories governingtheir issu...

We consider an extension of the proximal minimization algorithm where only some of the minimization variables appear in the quadratic proximal term. We interpret the resulting iterates in terms of the iterates of the standard algorithm and we show a uniform descent property, which holds independently of the proximal terms used. This property is used to give simple convergence proofs of parallel...