A method is proposed for solving equality constrained nonlinear optimization problems involving twice continuously differentiable functions. The method employs a trust funnel approach consisting of two phases: a first phase to locate an ǫ-feasible point and a second phase to seek optimality while maintaining at least ǫ-feasibility. A two-phase approach of this kind based on a cubic regularizati...

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set variational inequality (VI) problem in that each agent is associated with local monotone mapping. This finds an application computation best equilibrium nonlinear complementarity problems arising transportation networks. develop iteratively regularized incremental gradient method where...

In this paper a second-order method for solving large-scale strongly convex `1-regularized problems is developed. The proposed method is a NewtonCG (Conjugate Gradients) algorithm with backtracking line-search embedded in a doubly-continuation scheme. Worst-case iteration complexity of the proposed Newton-CG is established. Based on the analysis of Newton-CG, worstcase iteration complexity of t...

We consider variants of trust-region and cubic regularization methods for nonconvex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact Hessian, and using approximate solution of the corresponding sub-problems, we provide iteration complexity to achieve ǫ-approximate second-order optimality which have shown to be tight. Our Hessian approximation condi...

The sequential circuit designed was Look-Ahead Transformation based LFSR in which a hardware complexity was present and it may limit their employ in many applications. The design of efficient LFSR for BCH encoder using TePLAT (Term Preserving Look-Ahead Transformation) overcame this limitation by opening the employ of minimizing the iteration bound and hardware complexity in wide range of appli...

This paper describes a new technique for improving the performance of multistage parallel interference cancellation (PIC) multiuser detection. The focus of the paper is on the hard-decision multistage PIC detector due to the fact that it possesses two desirable properties: (a) very low computational complexity in binary communication systems and (b) the optimum (joint maximum likelihood) bit es...

The combination of multiple-input multiple-output (MIMO) signal processing with orthogonal frequency division multiplexing (OFDM) using Cyclic Prefix (CP) is regarded as a highly promising solution to achieving the data rates of next-generation wireless communication systems operating in frequency selective fading environments. In this paper, we propose a novel detection scheme for MIMO based t...

This paper presents an improved decision feedforward equalizer (DFFE) for high speed receivers in the presence of highly dispersive channels. This decision-aided equalizer technique has been recently proposed for multigigabit communication receivers, where the use of parallel processing is mandatory. Well-known parallel architectures for the typical decision feedback equalizer (DFE) have a comp...

In this paper we study primal-dual path-following algorithms for the second-order cone programming (SOCP) based on a family of directions that is a natural extension of the Monteiro-Zhang (MZ) family for semidefinite programming. We show that the polynomial iteration-complexity bounds of two well-known algorithms for linear programming, namely the short-step path-following algorithm of Kojima e...

Three interior point methods are proposed for sufficient horizontal linear complementarity problems (HLCP): a large update path following algorithm, a first order corrector-predictor method, and a second order corrector-predictor method. All algorithms produce sequences of iterates in the wide neighborhood of the central path introduced by Ai and Zhang. The algorithms do not depend on the handi...