in this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual interior point method (ipm) based on a new kernel function with a trigonometric barrier term. iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. although our proposed kernel function is neither a self-regular (sr) function nor logarithmic barrier ...

We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One re...

This study presents a new one-parameter family of the well-known fixed point iteration method for solving nonlinear equations numerically. The proposed is derived by implementing approximation through straight line. presence an arbitrary parameter in improves convergence characteristic simple as it has wider domain convergence. Furthermore, we propose many two-step predictor–corrector iterative...