We consider minimization of functions that are compositions of prox-regular functions with smooth vector functions. A wide variety of important optimization problems can be formulated in this way. We describe a subproblem constructed from a linearized approximation to the objective and a regularization term, investigating the properties of local solutions of this subproblem and showing that the...

In order to achieve a mutiscale representation and texture extraction for textured image, a hierarchical (BV, Gp, L ) decomposition model is proposed in this paper. We firstly introduce the proposed model which is obtained by replacing the fixed scale parameter of the original (BV, Gp, L 2 ) decomposition with a varying sequence. And then, the existence and convergence of the hierarchical decom...

This paper proposes a global cumulative constraint for cyclic scheduling problems. In cyclic scheduling a project graph is periodically re-executed on a set of limited capacity resources. The objective is to find an assignment of start times to activities such that the feasible repetition period λ is minimized. Cyclic scheduling is an effective method to maximally exploit available resources by...

We consider a modification of the OMM energy functional which contains an ℓ 1 penalty term in order to find a sparse representation of the low-lying eigenspace of self-adjoint operators. We analyze the local minima of the modified functional as well as the convergence of the modified functional to the original functional. Algorithms combining soft thresholding with gradient descent are proposed...

We present in this paper the alternating minimization method on CAT(0) spaces for solving unconstraints convex optimization problems. Under the assumption that the function being minimize is convex, we prove that the sequence generated by our algorithm converges to a minimize point. The results presented in this paper are the first ones of this type that have been given for theses spaces and al...

The article describes a new Boolean minimization and single-level partitioning method based on the BOOM minimization system [6]. The minimization is performed with respect to the restrictions stated for the number of inputs and outputs of individual components and/or with the goal to reach load balancing for the inputs. The method can handle extremely large functions (up to thousands of input v...

Most of the direct-cover Boolean minimization techniques use a four step cyclic algorithm. First, the algorithm chooses an On-minterm; second, it generates the set of prime implicants that covers the chosen minterm; third, it identifies the essential prime implicant; and fourth, it performs a covering operation. In this study, we focus on the third step and propose a new essential prime implica...

This paper examines the performance of time of arrival (TOA) estimation techniques for an UWB system employing a non-coherent energy collection receiver. The performance of two different algorithms, namely, the threshold-crossing (TC) and the maximum selection (MAX) algorithms, are compared in terms of TOA estimation error. The effect of the TOA estimation error on position calculation is evalu...