A modified infeasible homotopy algorithm for computing fixed point in general non-convex set
نویسندگان
چکیده
منابع مشابه
A path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملImproved infeasible-interior-point algorithm for linear complementarity problems
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 tar...
متن کاملOn the behavior of Lagrange multipliers in convex and non-convex infeasible interior point methods∗
This paper analyzes sequences generated by infeasible interior point methods. In convex and nonconvex settings, we prove that moving the primal feasibility at the same rate as complementarity will ensure that the Lagrange multiplier sequence will remain bounded, provided the limit point of the primal sequence has a Lagrange multiplier, without constraint qualification assumptions. We also show ...
متن کاملA modified Booth algorithm for high radix fixed-point multiplication
The Booth multiplication algorithm produces incorrect results for some word sizes, when it is extended for higher radix, fixed-point multiplication. We present a modification of the Booth algorithm that produces correct results when the radix is any power of 2 and the multipliers are of any size.
متن کاملSome fixed point theorems and common fixed point theorem in log-convex structure
Some fixed point theorems and common fixed point theorem in Logarithmic convex structure areproved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Nonlinear Sciences and Applications
سال: 2017
ISSN: 2008-1898,2008-1901
DOI: 10.22436/jnsa.010.11.27