we present a modified version of the infeasible-interior- we present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by mansouri et al. (nonlinear anal. real world appl. 12(2011) 545--561). each main step of the algorithm consists of a feasibility step and several centering steps. we use a different feasibility step, which targ...

In this paper, we present a primal-dual interior-point method for solving nonlinear programming problems. It employs a Levenberg-Marquardt (LM) perturbation to the Karush-Kuhn-Tucker (KKT) matrix to handle indefinite Hessians and a line search to obtain sufficient descent at each iteration. We show that the LM perturbation is equivalent to replacing the Newton step by a cubic regularization ste...

In recent years, some promising approximate analytical solutions are proposed, such as exp-function method [1], homotopy perturbation method [2 – 11], and variational iteration method (VIM) [12 – 17]. The variational iteration method is the most effective and convenient one for both weakly and strongly nonlinear equations. This method has been shown to effectively, easily, and accurately solve ...

in this paper, the approximate solution of the differential system modeling hiv infection of cd4+ t cells isobtained by a reliable algorithm based on an adaptation of the standard variational iteration method (vim), which is called the multi-stage variational iteration method(msvim). a comparison between msvim and the fourthorder runge-kutta method (rk4-method) reveal that the proposed techniqu...

Integro-partial differential equations occur in many contexts in mathematical physics. Typical examples include time-dependent diffusion equations containing a parameter ~e.g., the temperature! that depends on integrals of the unknown distribution function. The standard approach to solving the resulting nonlinear partial differential equation involves the use of predictor–corrector algorithms, ...

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...