this research with explaining of concept of reason and distending with knowledge talks about ethical complementarity of human and relation between that concept and growth of reason with emphasis on ghorar-al-hekam book of imam ali. in this article, we will receive to depth relation between reason and ethic on imam ali’s speeches and ethic without reason isn’t complete and reason without ethic c...

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...

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Ca...

In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...

0

‎A full Nesterov-Todd (NT) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using Euclidean Jordan algebra‎. ‎Two types of‎ ‎full NT-steps are used‎, ‎feasibility steps and centering steps‎. ‎The‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...

‎a full nesterov-todd (nt) step infeasible interior-point algorithm‎ ‎is proposed for solving monotone linear complementarity problems‎ ‎over symmetric cones by using euclidean jordan algebra‎. ‎two types of‎ ‎full nt-steps are used‎, ‎feasibility steps and centering steps‎. ‎the‎ ‎algorithm starts from strictly feasible iterates of a perturbed‎ ‎problem‎, ‎and, using the central path and feasi...