We introduce and analyze an exterior-pointmethod (EPM) for constrained optimization problems with both inequality constraints and equations. We show that under the standard second-order optimality conditions the EPM converges to the primal–dual solution with 1.5-Q-superlinear rate.

in this paper, we present a full newton step feasible interior-pointmethod for circular cone optimization by using euclidean jordanalgebra. the search direction is based on the nesterov-todd scalingscheme, and only full-newton step is used at each iteration.furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

in this paper, we prove some approximate fixed point results for proximinal valued $beta$-contractive multifunctions on metric spaces. we show that our results generalize some old fixed point results in the literature.

Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplexmethod. But their computational complexities are exponential, which is not satisfactory for solving largescale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programmi...