咨询与建议

限定检索结果

文献类型

  • 51 篇 期刊文献
  • 2 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 41 篇 理学
    • 40 篇 数学
    • 1 篇 物理学
  • 27 篇 管理学
    • 26 篇 管理科学与工程(可...
    • 1 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 24 篇 工学
    • 9 篇 软件工程
    • 7 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 3 篇 力学(可授工学、理...
    • 3 篇 控制科学与工程
    • 2 篇 石油与天然气工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 信息与通信工程
  • 2 篇 经济学
    • 1 篇 理论经济学
  • 1 篇 教育学
    • 1 篇 心理学(可授教育学...

主题

  • 53 篇 interior point a...
  • 16 篇 linear programmi...
  • 3 篇 linear complemen...
  • 2 篇 scalarizing func...
  • 2 篇 convex quadratic...
  • 2 篇 path-following a...
  • 2 篇 aspiration level...
  • 2 篇 algebraic equiva...
  • 2 篇 large-scale opti...
  • 2 篇 optimization
  • 2 篇 mathematical pro...
  • 2 篇 genetic algorith...
  • 2 篇 simplex method
  • 2 篇 power system opt...
  • 2 篇 potential functi...
  • 2 篇 strict complemen...
  • 2 篇 quadratic progra...
  • 2 篇 min cost flow pr...
  • 2 篇 potential reduct...
  • 2 篇 semidefinite pro...

机构

  • 4 篇 univ iowa dept m...
  • 3 篇 cornell univ sch...
  • 2 篇 cnr ist anal sis...
  • 2 篇 georgia inst tec...
  • 1 篇 natl acad sci uk...
  • 1 篇 univ pisa dipart...
  • 1 篇 univ london impe...
  • 1 篇 helsinki sch eco...
  • 1 篇 stanford univ de...
  • 1 篇 delft univ techn...
  • 1 篇 russian acad sci...
  • 1 篇 department of ma...
  • 1 篇 fed inst ceara d...
  • 1 篇 univ new s wales...
  • 1 篇 shandong coll el...
  • 1 篇 georgia inst tec...
  • 1 篇 univ firenze dip...
  • 1 篇 hitec univ taxil...
  • 1 篇 clemson univ cle...
  • 1 篇 industrial engin...

作者

  • 5 篇 ye yy
  • 3 篇 todd mj
  • 2 篇 monteiro rdc
  • 2 篇 e-nagy marianna
  • 2 篇 gondzio jacek
  • 2 篇 soares cmm
  • 2 篇 varga anita
  • 2 篇 guler o
  • 2 篇 herskovits j
  • 2 篇 mizuno s
  • 1 篇 gentile c
  • 1 篇 nesterov ye
  • 1 篇 elizabeth r. jes...
  • 1 篇 dias g
  • 1 篇 bellavia stefani...
  • 1 篇 stone re
  • 1 篇 gu jia
  • 1 篇 terlaky t
  • 1 篇 mokhtari s
  • 1 篇 expósito ag

语言

  • 50 篇 英文
  • 3 篇 其他
检索条件"主题词=Interior point algorithms"
53 条 记 录,以下是1-10 订阅
排序:
On extending kernel-based interior point algorithms for linear programming to convex quadratic second-order cone programming  12
On extending kernel-based interior point algorithms for line...
收藏 引用
12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)
作者: Li, Yanfang Duan, Xibo Gu, Jia Shandong Coll Electon Technol Dept Basic Educ Jinan 250200 Peoples R China Shandong Water Polytech Dept Basic Sci Rizhao 276826 Peoples R China Shanghai Univ Engn Sci Coll Fundamental Studies Shanghai 201620 Peoples R China
In this article, we extend kernel-based interior point algorithms for linear programming to convex quadratic programming overs second-order cones. By means of Jordan algebras, we establish the iteration complexity for... 详细信息
来源: 评论
ON THE FINITE CONVERGENCE OF interior-point algorithms FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1992年 第2期57卷 325-335页
作者: YE, YY 1. Department of Management Sciences The University of Iowa 52242 Iowa City IA USA
It has been shown [8] that numerous interior-point algorithms for linear programming (LP) generate solution sequences that converge to strict complementarity solutions, or interior solutions on the optimal face. In th... 详细信息
来源: 评论
CONVERGENCE BEHAVIOR OF interior-point algorithms
收藏 引用
MATHEMATICAL PROGRAMMING 1993年 第2期60卷 215-228页
作者: GULER, O YE, YY UNIV IOWA DEPT MANAGEMENT SCIIOWA CITYIA 52242
We show that most interior-point algorithms for linear programming generate a solution sequence in which every limit point satisfies the strict complementarity condition. These algorithms include all path-following al... 详细信息
来源: 评论
ON ADAPTIVE-STEP PRIMAL-DUAL interior-point algorithms FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 1993年 第4期18卷 964-981页
作者: MIZUNO, S TODD, MJ YE, YY CORNELL UNIV SCH OPERAT RES & IND ENGNITHACANY 14853 UNIV IOWA DEPT MANAGEMENT SCIIOWA CITYIA 52242
We describe several adaptive-step primal-dual interior point algorithms for linear programming. All have polynomial time complexity while some allow very long steps in favorable circumstances. We provide heuristic rea... 详细信息
来源: 评论
Proximity queries between convex objects: An interior point approach for implicit surfaces
收藏 引用
IEEE TRANSACTIONS ON ROBOTICS 2008年 第1期24卷 211-220页
作者: Chakraborty, Nilanjan Peng, Jufeng Akella, Srinivas Mitchell, John E. Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA Rensselaer Polytech Inst Dept Math Sci Troy NY 12180 USA
This paper presents a general method for exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computation algorithms are particularly important for applic... 详细信息
来源: 评论
A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
收藏 引用
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2023年 第3期31卷 691-711页
作者: E-Nagy, Marianna Varga, Anita Budapest Univ Technol & Econ Inst Math Dept Differential Equat Muegyet Rkp 3 H-1111 Budapest Hungary Corvinus Univ Budapest Corvinus Ctr Operat Res Fovam Ter 8 H-1093 Budapest Hungary
In this paper, we investigate a new primal-dual long-step interior point algorithm for linear optimization. Based on the step size, interior point algorithms can be divided into two main groups, short-step, and long-s... 详细信息
来源: 评论
RECOVERING AN OPTIMAL LP BASIS FROM AN interior-point SOLUTION
收藏 引用
OPERATIONS RESEARCH LETTERS 1994年 第4期15卷 169-178页
作者: BIXBY, RE SALTZMAN, MJ CLEMSON UNIV CLEMSONSC 29631 RICE UNIV DEPT COMPUTAT & APPL MATHHOUSTONTX 77251
An important issue in the implementation of interior point algorithms for linear programming is the recovery of an optimal basic solution from an optimal interior point solution. In this paper we describe a method for... 详细信息
来源: 评论
Presolve analysis and interior point solutions of the linear programming coordination problem of directional overcurrent relays
收藏 引用
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2001年 第8期23卷 819-825页
作者: Urdaneta, AJ Pérez, LG Gómez, JF Feijoo, B González, M Univ Simon Bolivar Dept Convers & Transporte Energia Caracas 1080 Venezuela
A linear programming interior point algorithm is proposed for the solution of the problem of coordinating directional overcurrent relays in interconnected power systems considering definite time backup relaying. The p... 详细信息
来源: 评论
Non-negatively constrained image deblurring with an inexact interior point method
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2009年 第1期231卷 236-248页
作者: Bonettini, Silvia Serafini, Thomas Univ Ferrara Dipartimento Matemat I-44100 Ferrara Italy Univ Modena & Reggio Emilia Dipartimento Matemat Modena Italy
Nonlinear image deblurring procedures based on probabilistic considerations have been widely investigated in the literature. This approach leads to model the deblurring problem as a large scale optimization problem, w... 详细信息
来源: 评论
An interior point method for solving systems of linear equations and inequalities
收藏 引用
OPERATIONS RESEARCH LETTERS 2000年 第3期27卷 101-107页
作者: Kallio, M Salo, S Helsinki Sch Econ Helsinki 00100 Finland
A simple interior point method is proposed for solving a system of linear equations subject to nonnegativity constraints. The direction of update is defined by projection of the current solution on a linear manifold d... 详细信息
来源: 评论