咨询与建议

限定检索结果

文献类型

  • 118 篇 期刊文献
  • 18 篇 会议
  • 1 篇 学位论文

馆藏范围

  • 137 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 94 篇 理学
    • 90 篇 数学
    • 3 篇 统计学(可授理学、...
    • 2 篇 生物学
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 系统科学
  • 73 篇 工学
    • 26 篇 计算机科学与技术...
    • 26 篇 软件工程
    • 11 篇 电气工程
    • 5 篇 材料科学与工程(可...
    • 5 篇 信息与通信工程
    • 4 篇 力学(可授工学、理...
    • 4 篇 土木工程
    • 2 篇 机械工程
    • 2 篇 冶金工程
    • 2 篇 控制科学与工程
    • 2 篇 石油与天然气工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 交通运输工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 生物医学工程(可授...
    • 1 篇 公安技术
  • 57 篇 管理学
    • 56 篇 管理科学与工程(可...
    • 1 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 5 篇 经济学
    • 3 篇 应用经济学
    • 2 篇 理论经济学

主题

  • 137 篇 interior-point a...
  • 15 篇 polynomial compl...
  • 12 篇 linear complemen...
  • 11 篇 linear programmi...
  • 10 篇 artificial neura...
  • 8 篇 superlinear conv...
  • 8 篇 genetic algorith...
  • 7 篇 shakedown analys...
  • 7 篇 kernel function
  • 6 篇 iteration bound
  • 6 篇 convex optimizat...
  • 6 篇 linear program
  • 6 篇 nonlinear progra...
  • 6 篇 full-newton step
  • 5 篇 complexity analy...
  • 5 篇 small-update met...
  • 5 篇 linear optimizat...
  • 4 篇 large neighborho...
  • 4 篇 arc-search
  • 4 篇 large-scale prob...

机构

  • 9 篇 zhejiang sci tec...
  • 7 篇 hazara univ dept...
  • 6 篇 zhejiang a&f uni...
  • 5 篇 shanghai univ de...
  • 5 篇 rhein westfal th...
  • 5 篇 natl yunlin univ...
  • 4 篇 univ iowa dept m...
  • 4 篇 shanghai univ en...
  • 4 篇 univ maryland ba...
  • 3 篇 tech univ cartag...
  • 3 篇 rhein westfal th...
  • 3 篇 college of scien...
  • 3 篇 zhejiang a&f uni...
  • 2 篇 mathematics depa...
  • 2 篇 comsats univ isl...
  • 2 篇 shanghai univ en...
  • 2 篇 yuzuncu yil univ...
  • 2 篇 college of scien...
  • 2 篇 cornell univ dep...
  • 2 篇 shanghai normal ...

作者

  • 9 篇 xu yinghong
  • 9 篇 sabir zulqurnain
  • 9 篇 zhang lipu
  • 8 篇 raja muhammad as...
  • 7 篇 zhang mingwang
  • 6 篇 potra fa
  • 5 篇 wang g. q.
  • 5 篇 umar muhammad
  • 4 篇 kojima m
  • 4 篇 weichert dieter
  • 4 篇 huang zhengwei
  • 4 篇 ye yy
  • 4 篇 simon jaan-wille...
  • 4 篇 potra florian a.
  • 4 篇 yuan beibei
  • 3 篇 freund rm
  • 3 篇 guirao juan l. g...
  • 3 篇 saeed tareq
  • 3 篇 白延琴
  • 3 篇 shida m

语言

  • 127 篇 英文
  • 6 篇 其他
  • 4 篇 中文
检索条件"主题词=Interior-point algorithm"
137 条 记 录,以下是31-40 订阅
排序:
A Wide Neighborhood Arc-Search interior-point algorithm for Convex Quadratic Programming
收藏 引用
Wuhan University Journal of Natural Sciences 2017年 第6期22卷 465-471页
作者: YUAN Beibei ZHANG Mingwang HUANG Zhengwei College of Science China Three Gorges University Yichang 443002 Hubei China College of Economics and Management China Three Gorges University Yichang 443002 Hubei China
In this paper, we propose an arc-search interior-point algorithm for convex quadratic programming with a wide neighborhood of the central path, which searches the optimizers along the ellipses that approximate the ent... 详细信息
来源: 评论
Optimal Static State-Feedback Controller Design for MIMO LTI Systems Based on Constraints Block Roots and interior-point algorithm: Application to Gas Compressor System
Optimal Static State-Feedback Controller Design for MIMO LTI...
收藏 引用
International Conference on Applied Smart Systems (ICASS)
作者: Nail, Bachir Kouzou, Abdellah Hafaifa, Ahmed Puig, Vicenc Univ Djelfa Appl Automat & Ind Diagnost Lab LAADI Djelfa Algeria UPC Automat Control Dept TR11Rambla St Nebridi 10 Terrassa 08222 Spain
The paper presents, An optimal Static State-Feedback controller (SSF) approach, addressed to class of MultiInput/Multi-Output (MIMO) Linear Invariant-Time (LTI) systems. The block roots of the matrix polynomial are th... 详细信息
来源: 评论
An Infeasible Primal-Dual interior-point algorithm for Linearly Constrained Convex Optimization Based on A Parametric Kernel Function
An Infeasible Primal-Dual Interior-Point Algorithm for Linea...
收藏 引用
2nd International Joint Conference on Computational Sciences and Optimization (CSO)
作者: Wang, Guoqiang Wang, Baocun Fan, Qingduan Shanghai Univ Engn Sci Coll Vocat Technol Shanghai 200437 Peoples R China Shanghai Univ Engn Sci Coll Fundamental Studies Shanghai 200336 Peoples R China
In this paper we present an infeasible primal-dual interior-point algorithm for linearly constrained convex optimization based on a parametric kernel function, with parameters p is an element of [0, 1] and q >= 1. ... 详细信息
来源: 评论
Online Identification for Hypersonic Vehicle Using Recursive Maximum Likelihood Method Based on interior-point algorithm
Online Identification for Hypersonic Vehicle Using Recursive...
收藏 引用
第25届中国控制与决策会议
作者: Chaofang Hu Qizhi Liu School of Electrical Engineering and Automation Tianjin University
The purpose of this paper is to propose a recursive maximum likelihood method based on interior-point algorithm to online estimate the uncertain aerodynamic parameters for hypersonic vehicles. In order to improve the ... 详细信息
来源: 评论
A path-following infeasible-interior-point algorithm for linear complementarity problems
收藏 引用
Optimization Methods and Software 1993年 第2期2卷 79-106页
We describe an infeasible-interior-point algorithm for monotone linear complementarity problems that has polynomial complexity, global linear convergence, and local superlinear convergence with a Q-order of 2. Only on... 详细信息
来源: 评论
A full-step interior-point algorithm for linear complementarity problem based on a simple function
收藏 引用
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES 2011年 第6期32卷 1315-1332页
作者: Zhang, Lipu Xu, Yinghong Zhejiang A&F Univ Dept Math Zhejiang 311300 Peoples R China Shanghai Univ Dept Math Shanghai 200444 Peoples R China Zhejiang Sci Tech Univ Dept Math Zhejiang 310018 Peoples R China
In this paper, we design and analyze a new full-step interior-point algorithm for linear complementarity problem based on a very simple function. The algorithm uses the simple function to determine the searching direc... 详细信息
来源: 评论
A WIDE NEIGHBORHOOD PRIMAL-DUAL interior-point algorithm WITH ARC-SEARCH FOR LINEAR COMPLEMENTARITY PROBLEMS
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS
收藏 引用
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS 2018年 2018卷
作者: Yuan, Beibei Zhang, Mingwang Huang, Zhengwei China Three Gorges Univ Three Gorges Math Res Ctr Yi Chang 443002 Peoples R China China Three Gorges Univ Coll Econ & Management Yi Chang 443002 Peoples R China
In this paper, ellipsoidal estimations are used to track the central path of a linear complementarity problem (LCP). A wide neighborhood primal-dual interior-point algorithm is devised to search an epsilon-approximate... 详细信息
来源: 评论
Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
收藏 引用
Journal of Shanghai University(English Edition) 2008年 第5期12卷 388-394页
作者: 钱忠根 白延琴 王国强 Department of Basic Courses Jiangsu Teachers University of Technology Changzhou 213001 P. R. China Department of Mathematics College of Sciences Shanghai University Shanghai 200444 P. R. China College of Vocational Technology Shanghai University of Engineering Science Shanghai 200437 P. R. China
interior-point methods (IPMs) for linear optimization (LO) and semidefinite optimization (SDO) have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with si... 详细信息
来源: 评论
A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
收藏 引用
Journal of Shanghai University(English Edition) 2008年 第6期12卷 475-480页
作者: 张敏 白延琴 王国强 Department of Mathematics College of Sciences Shanghai University College of Vocational Technology Shanghai University of Engineering Science
In this paper, a primal-dual path-following interior-point algorithm for linearly constrained convex optimization(LCCO) is *** algorithm is based on a new technique for finding a class of search directions and the str... 详细信息
来源: 评论
The Complexity Analysis of an Efficient interior-point algorithm for Linear Optimization
The Complexity Analysis of an Efficient Interior-Point Algor...
收藏 引用
The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)
作者: Liying Liu Liya Fan College of Mathematics Science Liaocheng UniversityLiaocheng252059China
In this paper, an efficient primal-dual interiorpoint algorithm for large-update methods is introduced by means of a new kernel function. We analysis the complexity of the algorithm and conclude that its iteration ... 详细信息
来源: 评论