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

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

Journal: :bulletin of the iranian mathematical society 2012
maryam zangiabadi hossein mansouri

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

The search for finding the local minimization in unconstrained optimization problems and a fixed point of the gradient system of ordinary differential equations are two close problems. Limited-memory algorithms are widely used to solve large-scale problems, while Rang Kuta's methods are also used to solve numerical differential equations. In this paper, using the concept of sub-space method and...

Journal: :SIAM Journal on Optimization 2009
Florian A. Potra Josef Stoer

A new class of infeasible interior point methods for solving sufficient linear complementarity problems requiring one matrix factorization andm backsolves at each iteration is proposed and analyzed. The algorithms from this class use a large (N− ∞) neighborhood of an infeasible central path associated with the complementarity problem and an initial positive, but not necessarily feasible, starti...

Journal: :Physics in medicine and biology 2003
Jinyi Qi

Iterative image estimation methods have been widely used in emission tomography. Accurate estimation of the uncertainty of the reconstructed images is essential for quantitative applications. While both iteration-based noise analysis and fixed-point noise analysis have been developed, current iteration-based results are limited to only a few algorithms that have an explicit multiplicative updat...

Journal: :Math. Program. 2015
Wei Bian Xiaojun Chen Yinyu Ye

We propose a first order interior point algorithm for a class of nonLipschitz and nonconvex minimization problems with box constraints, which arise from applications in variable selection and regularized optimization. The objective functions of these problems are continuously differentiable typically at interior points of the feasible set. Our first order algorithm is easy to implement and the ...

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

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