[Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Registration ::
Main Menu
Home::
Journal Information::
Articles archive::
Submission Instruction::
Registration::
Submit article::
Site Facilities::
Contact us::
::
Google Scholar

Citation Indices from GS

AllSince 2015
Citations4789418705
h-index97
i10-index94

Search in website

Advanced Search
Receive site information
Enter your Email in the following box to receive the site news and information.
:: Search published articles ::
Showing 1 results for Siyavash

Mansouri, Siyavash, Zangiabadi,
Volume 3, Issue 1 (4-2012)
Abstract

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 steps, namely O(nlogn/e) , which is as good as the linear analogue.

Page 1 from 1     

مجله انجمن ایرانی تحقیق در عملیات Iranian Journal of Operations Research
Persian site map - English site map - Created in 0.04 seconds with 27 queries by YEKTAWEB 4227