نتایج جستجو برای: multi point iteration

تعداد نتایج: 994803  

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

Journal: :Math. Program. 2004
Zheng-Hai Huang Liqun Qi Defeng Sun

Given M ∈ <n×n and q ∈ <, the linear complementarity problem (LCP) is to find (x, s) ∈ < × < such that (x, s) ≥ 0, s = Mx + q, x s = 0. By using the ChenHarker-Kanzow-Smale (CHKS) smoothing function, the LCP is reformulated as a system of parameterized smooth-nonsmooth equations. As a result, a smoothing Newton algorithm, which is a modified version of the Qi-Sun-Zhou algorithm [Mathematical Pr...

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

2015
László Somlyai

This paper presents a three dimensional reconstruction and map building method for mobile robots. The system is able to evaluate the movement of vehicle in real time and continuously update the necessary maps based on new information with the help of using data of the Kinect sensor. The essence of method is that two three-dimensional reconstruction of environment made in different times are lar...

Journal: :CoRR 2013
Hubert Karl Sebstian Karl

It is well known that a fixed point iteration for solving a linear equation system converges if and only if the spectral radius of the iteration matrix is less than one. A method is presented which guarantees the Fixed Point, even if this condition is not ("spectral radius<1") fulfilled and demonstrated through calculation examples.

Journal: :Applied Mathematics and Computation 2005
M. A. Ahmed

Necessary and sufficient conditions for the convergence of Picard iteration to a fixed point for a continuous mapping in metric spaces are established. As application, we prove the convergence theorem of Ishikawa iteration to a fixed point for a nonexpansive mapping in Banach spaces. 2004 Elsevier Inc. All rights reserved.

Journal: :J. Global Optimization 1994
H. Edwin Romeijn Robert L. Smith

Hide-and-Seek is a powerful yet simple and easily implemented continuous simulated annealing algorithm for finding the maximum of a continuous function over an arbitrary closed, bounded and full-dimensional body. The function may be nondifferentiable and the feasible region may be noneonvex or even disconnected. The algorithm begins with any feasible interior point. In each iteration it generat...

2013
Samir Bouali Samir Kabbaj

In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasibl...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید