检索结果-内蒙古大学图书馆

A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION

ANZIAM JOURNAL 2010年第4期51卷 476-491页

作者： Cho, G. M. Cho, Y. Y. Lee, Y. H. Dongseo Univ Dept Multimedia Engn Pusan 617716 South Korea Pusan Natl Univ Dept Math Pusan 609735 South Korea

We propose a new primal-dual interior-point algorithm based on a new kernel function for linear optimization problems. New search directions and proximity functions are proposed based on the kernel function. We show that the new algorithm has O(root n log n log(n/epsilon)) and O(root n log(n/epsilon)) iteration bounds for large-update and small-update methods, respectively, which are currently the best known bounds for such methods.

关键词： primal-dual interior-point method kernel function complexity polynomial algorithm linear optimization problem

来源：评论

学校读者我要写书评

暂无评论

On which targets should we compromise in conservation prioritization problems?

引用

METHODS IN ECOLOGY AND EVOLUTION 2017年第12期8卷 1858-1865页

作者： Kaim, Andrea Watts, Matthew E. Possingham, Hugh P. UFZ Helmholtz Ctr Environm Res Dept Computat Landscape Ecol Leipzig Germany Univ Queensland ARC Ctr Excellence Environm Decis Ctr Biodivers & Conservat Sci Brisbane Qld Australia

1. Systematic conservation planning is an essential part of biodiversity preservation. In the context of conservation prioritization problems, the total cost of the entire reserve system is highly dependent on how big we set targets (e.g. 10% or 30%) for conservation features (e.g. species or habitats). Thus, it is of interest to conservation planners how targets could be adjusted in a reasonable way, in order to decrease total cost. The aim of this paper is to rank features based on their influence on total cost. 2. Focusing on the minimum set coverage probleman integer linear optimization problem (ILP)we developed a method to rank features according to their influence on total cost. Since the computation time is often too high to solve the ILP, we approximated its optimal solutions by the results of a linear optimization problem (LP). For the feature ranking, we used the shadow prices of the LP, validating it with rankings created by methods which used an ILP solver and the software Marxan, which uses a simulated annealing algorithm. 3. The results show that shadow prices can be used to rank features in terms of their impact on the total cost of the reserve system thereby identifying those feature targets that could yield better compromises. 4. Thus, the shadow price ranking provides a novel tool for conservation planners to help set feature targets in conservation prioritization problems. Furthermore, the results of the study can be used to improve Marxan.

关键词： conservation management supporting tool linear optimization problem Marxan shadow prices rank spatial prioritization systematic conservation planning target setting

来源：评论

学校读者我要写书评

暂无评论

Robust portfolio selection under norm uncertainty

引用

JOURNAL OF INEQUALITIES AND APPLICATIONS 2016年第1期2016卷 1-10页

作者： Wang, Lei Cheng, Xi Southwestern Univ Finance & Econ Dept Econ Math Chengdu 610074 Sichuan Peoples R China Chengdu Univ Technol Sch Geophys Chengdu 610059 Sichuan Peoples R China

In this paper, we consider the robust portfolio selection problem which has a data uncertainty described by the (p,w)-norm in the objective function. We show that the robust formulation of this problem is equivalent to a linear optimization problem. Moreover, we present some numerical results concerning our robust portfolio selection problem.

关键词： portfolio selection (p,w)-norm uncertainty set linear optimization problem

来源：评论

学校读者我要写书评

暂无评论

An efficient one-step-ahead optimal control for urban signalized traffic networks based on an averaged Cell-Transmission model

An efficient one-step-ahead optimal control for urban signal...

引用

European Control Conference (ECC)

作者： Grandinetti, Pietro de Wit, Carlos Canudas Garin, Federica NeCS Team Grenoble France GIPSA Lab St Martin Dheres France CNRS Res F-75700 Paris France Inria Rhone Alpes Montbonnot St Martin France

ISBN: (纸本)9783952426937

This paper presents a model for large urban traffic networks, based on the well-known macroscopic Cell Transmission Model. We start by describing the dynamics of traffic flow at signalized intersections. Then we develop an average-based approximation of such a system, that we use to build our control algorithm as a linear optimization problem. Simulation results validate the averaged approach and show the effectiveness of the proposed control strategy.

关键词： approximation theory linear systems optimal control optimisation road traffic control average-based approximation averaged cell-transmission model control algorithm linear optimization problem macroscopic cell transmission model one-step-ahead optimal control traffic flow urban signalized traffic networks Approximation methods Computational modeling Mathematical model optimization Roads Vehicle dynamics Vehicles

来源：评论

学校读者我要写书评

暂无评论

Framework for selective flip-flop replacement for soft error mitigation 28

Framework for selective flip-flop replacement for soft error...

引用

28th International Conference on VLSI Design (VLSID) / 14th International Conference on Embedded Systems

作者： Torvi, Pavan Vithal Devanathan, V. R. Kamakoti, V. Texas Instruments India Pvt Ltd Bangalore 560093 Karnataka India Texas Instruments Inc Dallas TX 75243 USA IIT Madras Dept CSE Chennai 600036 Tamil Nadu India

ISBN: (纸本)9781479966585

With increasing adoption of newer technologies and architectures targeted for automotive and aviation electronics with an objective to improve performance and/or reduce power/area, soft-error robustness is becoming an important issue to ensure reliable operation for an extended lifetime over a wide range of operating conditions. In this paper, we propose a modeling and optimization framework to systematically improve the FIT (failure-in-time) rate of a design with minimal impact on power, performance and area. We first propose a framework to model and evaluate the relative vulnerability to soft errors of the standard master-slave flip-flops and Dual Interlocked Storage Cells (DICE) in the cell library. Later, we formulate a linear optimization problem using this information to selectively replace the flip-flops so as to improve the FIT rate of the design with minimal impact on area and power. Employing the proposed technique on a popular industrial IP core shows a 32% relative improvement in the design robustness with just 2% increase in design area.

关键词： flip-flops logic circuits microprocessor chips optimisation radiation hardening (electronics) DICE automotive electronics aviation electronics cell library dual interlocked storage cells failure-in-time rate industrial IP core linear optimization problem selective flip-flop replacement soft error mitigation standard master-slave flip-flops Clocks Computational modeling Integrated circuit modeling Latches Silicon Standards Transient analysis cell library flip-flops automotive electronics Latch Device Component integrated circuit modelling Microprocessor chips Logic circuits Timing devices Transient analysis Computational modeling Frameworks Silicon

来源：评论

学校读者我要写书评

暂无评论

New Performance Index "Attractiveness Factor" for Evaluating Websites via Obtaining Transition of Users' Interests

引用

DATA SCIENCE AND ENGINEERING 2020年第1期5卷 48-64页

作者： Yoshida, Akihiro Higurashi, Tatsuru Maruishi, Masaki Tateiwa, Nariaki Hata, Nozomi Tanaka, Akira Wakamatsu, Takashi Nagamatsu, Kenichi Tajima, Akira Fujisawa, Katsuki Kyushu Univ Grad Sch Math Fukuoka Japan Yahoo Japan Corp Tokyo Japan Kyushu Univ Inst Math Ind Fukuoka Japan

The studies of browsing behavior have gained increasing attention in web analysis for providing better service. Most of the conventional approaches focus on simple indices such as average dwell time and conversion rate. These indices make similar evaluations to websites even if their features are significantly different. Moreover, such statistical indices are not sensitive to the dynamics of users' interests. In this paper, we propose a new framework for measuring a website's attractiveness that takes into account both the distribution and dynamics of users' interests. Within the framework, we define a new index for the website, called Attractiveness Factor, which evaluates the degree of users' attention. It consists of three procedures: First, we capture the transition of users' interests during browsing by solving a nonnegative matrix factorization and constrained network flow problems. To accommodate multiple types of interests of a user, we applied a soft clustering as opposed to a hard clustering to model attributes of users and websites. Second, for each website, the feature of each cluster is obtained by fitting the dwell time distribution with Weibull distribution. Finally, we calculate Attractiveness Factor of a website by applying the results of clustering and fitting. Attractiveness Factor depends on the distribution of the dwell time of users interested in the website, which reflects the change of interest of users. Numerical experiments with real web access data of Yahoo Japan News are conducted by solving extremely large-scale optimization problems. They show that Attractiveness Factor captures more exceptional information about browsing behavior more effectively than well-used indices. Attractive factors give low ratings to category pages;however, it can assign high ratings to websites that attract many people, such as hot topic news about the 2018 FIFA World Cup, Japan's new imperial era' REIWA,' and North Korea-the United States Hanoi Summit. Moreov

关键词： User behavior data Weibull distribution Network flow problem Nonnegative matrix factorization linear optimization problem

来源：评论

学校读者我要写书评

暂无评论

An adaptive-step primal-dual interior point algorithm for linear optimization

引用

NONlinear ANALYSIS-THEORY METHODS & APPLICATIONS 2009年第12期71卷 E2305-E2315页

作者： Kim, Min Kyung Lee, Yong-Hoon Cho, Gyeong-Mi Dongseo Univ Dept Multimedia Engn Pusan 617716 South Korea Pusan Natl Univ Dept Math Pusan South Korea

A common feature shared by most practical algorithms in interior point methods is the use of Mehrotra's predictor-corrector algorithm in [S. Mehrotra, On the implementation of a (primal-dual) interior point method, SIAM Journal on optimization 2 (1992) 575-601.] where the predictor step is never performed but it is used only to calculate an adaptive update, and thus instead of a predictor and a corrector centering step, a single Newton step is made toward the adaptively chosen target. In this paper we propose a new adaptive single-step large-update primal-dual interior point algorithm with wide neighborhood for linear optimization(LO) problems based on the simple kernel function which is first defined in [Y.Q. Bai, C. Roos, A primal-dual interior-point method based on a new kernel function with linear growth rate, in: Proceedings of Industrial optimization Symposium and optimization Day, Nov., 2002]. We show that the algorithm has O(q root n tau log(n/epsilon)) complexity which is similar to the one in the above-mentioned reference. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Adaptive-step Primal-dual interior point method Large-update Kernel function Polynomial algorithm Worst-case complexity linear optimization problem

来源：评论

学校读者我要写书评

暂无评论

A self-concordant exponential kernel function for primal-dual interior-point algorithm

引用

optimization 2014年第6期63卷 931-953页

作者： Bai, Yan-Qin Zhang, Jing Ma, Peng-Fei Zhang, Lian-Sheng Shanghai Univ Dept Math Shanghai Peoples R China

Self-concordant (SC) function is essential to analyzing primal-dual interior-point methods with polynomial-time complexity bound. In this paper, we introduce an exponential kernel function and prove that it is an SC function. Furthermore, we investigate its properties and find it is neither an eligible kernel function nor an SC barrier function. Nevertheless, based on this SC exponential kernel function, we present primal-dual interior-point algorithm for solving linear optimization problems. We analyse the algorithm and derive the complexity bound for large-update methods, which coincides with that of the algorithm based on the logarithmic function. Finally, the comparative numerical results are reported.

关键词： linear optimization problem interior-point methods self-concordant function 90C05 90C51

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：