نتایج جستجو برای: linear predictor

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

1991
Y Ye R A Tapia Y Zhang

In this note we consider a large step modiication of the Mizuno-Todd-Ye O(p nL) predictor-corrector interior-point algorithm for linear programming. We demonstrate that the modiied algorithm maintains its O(p nL)-iteration complexity, while exhibiting superlinear convergence for general problems and quadratic convergence for non-degenerate problems. To our knowledge, this is the rst constructio...

Journal: :Optimization Methods and Software 2005
Florian A. Potra Xing Liu

Two predictor-corrector methods of order m = Ω(logn) are proposed for solving sufficient linear complementarity problems. The methods produce a sequence of iterates in the N− ∞ neighborhood of the central path. The first method requires an explicit upper bound κ of the handicap of the problem while the second method does not. Both methods have O((1 + κ)1+1/m √ nL) iteration complexity. They are...

2007
Mohammad H. Koulaei Tamás Terlaky

It has been shown in various papers that most interior-point algorithms and their analysis can be generalized to semidefinite optimization. This paper presents an extension of the recent variant of Mehrotra’s predictor-corrector algorithm that was proposed by Salahi et al. (2005) for linear optimization problems. Based on the NT (Nesterov and Todd 1997) direction as Newton search direction it i...

Journal: :Comp. Opt. and Appl. 2011
Filiz Gürtuna Cosmin G. Petra Florian A. Potra Olena Shevchenko Adrian Vancea

We present a new corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available. In contrast with its predictor-corrector counterpart proposed by Miao, the method does not depend on the handicap κ of the problem. The method has O((1+ κ)√nL)-iteration complexity, the same as Miao’s method, but our error est...

2004
Costas Kravaris

Many industrially important processes feature both nonlinear system dynamics and a process deadtime. Powerful deadtime compensation methods, such as the Smith predictor, are available for linear systems represented by transfer functions. A Smith predictor structure in state space for linear systems is presented first and then directly extended to nonlinear systems. When combined with input /out...

In this paper, the non-Fourier heat conduction in a semi-infinite body was examined. The heat wave non-Fourier heat conduction model was used for thermal analysis. Thermal conductivity was assumed temperature-dependent which resulted in a non-linear equation. The heat source was also considered temperature-dependent which resulted in a non-homogeneous equation. The Mac-Cormack predictor-correct...

1997
K. J. Worsley

This paper presents a new method for characterizing brain responses in both PET and fMRI data. The aim is to capture the correlations between the scans of an experiment and a set of external predictor variables that are thought to affect the scans, such as type, intensity, or shape of stimulus response. Its main feature is a Canonical Variates Analysis (CVA) of the estimated effects of the pred...

Journal: :SIAM Journal on Optimization 2005
Jiming Peng Tamás Terlaky Yunbin Zhao

It is well known that the so-called first-order predictor-corrector methods working in a large neighborhood of the central path are among the most efficient interior-point methods (IPMs) for linear optimization (LO) problems. However, the best known iteration complexity of this type of methods is O (

2014
T. Jayakumar K. Kanagarajan

In this paper we study numerical methods for hybrid fuzzy differential equations by an application of the Adams fifth order predictor-corrector method for fuzzy differential equations. We prove a convergence result and give numerical examples to illustrate the theory.

Journal: :SIAM Journal on Optimization 2003
Renato D. C. Monteiro Takashi Tsuchiya

In this paper we present a variant of Vavasis and Ye’s layered-step path following primaldual interior-point algorithm for linear programming. Our algorithm is a predictor-corrector type algorithm which uses from time to time the least layered squares (LLS) direction in place of the affine scaling direction. It has the same iteration-complexity bound of Vavasis and Ye’s algorithm, namely O(n3.5...

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

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