On the equivalence between the super-exponential algorithm and a gradient search method
نویسندگان
چکیده
This paper reviews the Super-exponential algorithm proposed by Shalvi and Weinstein for blind channel equalization. We show that the algorithm coincides with a gradient search of a maximum of a cost function, which belongs to a family of functions very relevant in blind channel equalization. This family traces back to Donoho’s work on minimum entropy deconvolution, and also underlies the Godard (or Constant Modulus) and the ShalviWeinstein algorithms. Using this gradient search interpretation, we give a simple proof of convergence for the Super-exponential algorithm. Finally, we show that the gradient step-size choice giving rise to the super-exponential algorithm is optimal.
منابع مشابه
SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملA gradient search interpretation of the super-exponential algorithm
This correspondence reviews the super-exponential algorithm proposed by Shalvi and Weinstein for blind channel equalization. The principle of this algorithm—Hadamard exponentiation, projection over the set of attainable combined channel-equalizer impulse responses followed by a normalization—is shown to coincide with a gradient search of an extremum of a cost function. The cost function belongs...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کامل