咨询与建议

限定检索结果

文献类型

  • 15 篇 期刊文献
  • 1 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 14 篇 理学
    • 14 篇 数学
  • 13 篇 管理学
    • 13 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 12 篇 工学
    • 11 篇 软件工程
    • 2 篇 计算机科学与技术...
    • 1 篇 机械工程
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 16 篇 projective algor...
  • 11 篇 linear programmi...
  • 4 篇 karmarkar algori...
  • 4 篇 karmarkar's algo...
  • 3 篇 interior point m...
  • 2 篇 conical projecti...
  • 2 篇 fractional linea...
  • 2 篇 standard form
  • 2 篇 interior methods
  • 1 篇 nondifferentiabl...
  • 1 篇 cutting plane me...
  • 1 篇 homology derivat...
  • 1 篇 karmarkars algor...
  • 1 篇 path-following
  • 1 篇 analytic center
  • 1 篇 interior-point m...
  • 1 篇 rank-one updates
  • 1 篇 pencil of circle...
  • 1 篇 phase i
  • 1 篇 path following

机构

  • 2 篇 univ geneva dept...
  • 1 篇 mcgill univ fac ...
  • 1 篇 univ geneva logi...
  • 1 篇 dept econ commer...
  • 1 篇 yale univ sch ma...
  • 1 篇 yale school of o...
  • 1 篇 1. department of...
  • 1 篇 1. coppe federal...
  • 1 篇 shell dev co wes...
  • 1 篇 south ural state...
  • 1 篇 univ geneva logi...
  • 1 篇 1.yale school of...
  • 1 篇 ecole hautes etu...
  • 1 篇 1. school of ope...
  • 1 篇 mcgill univ fac ...
  • 1 篇 univ catholique ...
  • 1 篇 1. department of...
  • 1 篇 1. department of...

作者

  • 5 篇 vial jp
  • 4 篇 anstreicher km
  • 4 篇 goffin jl
  • 2 篇 gonzaga cc
  • 1 篇 todd mj
  • 1 篇 korotkiy v. a.
  • 1 篇 goldfarb d
  • 1 篇 xiao d
  • 1 篇 khmarova l. i.
  • 1 篇 usmanova e. a.
  • 1 篇 morshedi am
  • 1 篇 turner k
  • 1 篇 haurie a
  • 1 篇 dennis je
  • 1 篇 anstreicher kurt...

语言

  • 16 篇 英文
检索条件"主题词=Projective algorithm"
16 条 记 录,以下是1-10 订阅
排序:
A Monotonic projective algorithm for Fractional Linear Programming
收藏 引用
algorithmICA 1986年 第1-4期1卷 483-498页
作者: Anstreicher, Kurt M. Yale Univ Sch Management New Haven CT 06520 USA
We demonstrate that Karmarkar's projective algorithm is fundamentally an algorithm for fractional linear programming on the simplex. Convergence for the latter problem is established assuming only an initial lower... 详细信息
来源: 评论
STRICT MONOTONICITY AND IMPROVED COMPLEXITY IN THE STANDARD FORM projective algorithm FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1993年 第3期62卷 517-535页
作者: ANSTREICHER, KM UNIV CATHOLIQUE LOUVAIN CTR OPERAT RES & ECONOMETRB-1348 LOUVAINBELGIUM
In a recent paper, Shaw and Goldfarb show that a version of the standard form projective algorithm can achieve O(square-root n L) step complexity, opposed to the O(nL) step complexity originally demonstrated for the a... 详细信息
来源: 评论
ON THE COMPUTATION OF WEIGHTED ANALYTIC CENTERS AND DUAL ELLIPSOIDS WITH THE projective algorithm
收藏 引用
MATHEMATICAL PROGRAMMING 1993年 第1期60卷 81-92页
作者: GOFFIN, JL VIAL, JP UNIV GENEVA DEPT ECON COMMERCIALE & IND CH-1211 GENEVA 4 SWITZERLAND
The primal projective algorithm for linear programs with unknown optimal objective function value is extended to the case where one uses a weighted Karmarkar potential function. This potential is defined with respect ... 详细信息
来源: 评论
ON ANSTREICHERS COMBINED PHASE-I PHASE-II projective algorithm FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1992年 第1期55卷 1-15页
作者: TODD, MJ 1. School of Operations Research and Industrial Engineering College of Engineering Cornell University 14853 Ithaca NY USA
Anstreicher has proposed a variant of Karmarkar's projective algorithm that handles standard-form linear programming problems nicely. We suggest modifications to his method that we suspect will lead to better sear... 详细信息
来源: 评论
A COMBINED PHASE-I PHASE-II projective algorithm FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1989年 第2期43卷 209-223页
作者: ANSTREICHER, KM 1.Yale School of Organization and Management Box 1A 06520 New Haven CT USA
We devise a projective algorithm which explicitly considers the constraint that an artificial variable be zero at the solution. Inclusion of such a constraint allows the algorithm to be applied to a (possibly infeasib... 详细信息
来源: 评论
SHORT STEPS WITH KARMARKARS projective algorithm FOR LINEAR-PROGRAMMING
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1994年 第1期4卷 193-207页
作者: GOFFIN, JL VIAL, JP MCGILL UNIV FAC MANAGEMENTMONTREAL H3A 165PQCANADA DEPT ECON COMMERCIALE & IND CH-1211 GENEVA 4SWITZERLAND
A path-following, or short-step, version of Karmarkar's algorithm is proposed. When the first term of Karmarkar's potential function is given the weight (n + n(delta)), with delta greater than or equal to 0, t... 详细信息
来源: 评论
DECOMPOSITION AND NONDIFFERENTIABLE OPTIMIZATION WITH THE projective algorithm
收藏 引用
MANAGEMENT SCIENCE 1992年 第2期38卷 284-302页
作者: GOFFIN, JL HAURIE, A VIAL, JP ECOLE HAUTES ETUD COMMERCIALES MONTREAL GERADMONTREALQUEBECCANADA UNIV GENEVA DEPT ECON COMMERCIALE & INDCH-1211 GENEVA 4SWITZERLAND
This paper deals with an application of a variant of Karmarkar's projective algorithm for linear programming to the solution of a generic nondifferentiable minimization problem. This problem is closely related to ... 详细信息
来源: 评论
A PRIMAL projective INTERIOR POINT METHOD FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1991年 第1期51卷 17-43页
作者: GOLDFARB, D XIAO, D 1. Department of Industrial Engineering and Operations Research Columbia University 10027 New York NY USA
We present a new projective interior point method for linear programming with unknown optimal value. This algorithm requires only that an interior feasible point be provided. It generates a strictly decreasing sequenc... 详细信息
来源: 评论
SEARCH DIRECTIONS FOR INTERIOR LINEAR-PROGRAMMING METHODS
收藏 引用
algorithmICA 1991年 第2期6卷 153-181页
作者: GONZAGA, CC 1. Department of Electrical Engineering and Computer Sciences University of California 94720 Berkeley CA USA
Since Karmarkar published his algorithm for linear programming, several different interior directions have been proposed and much effort was spent on the problem transformations needed to apply these new techniques. T... 详细信息
来源: 评论
A path-following version of the Todd-Burrell procedure for linear programming
收藏 引用
MATHEMATICAL METHODS OF OPERATIONS RESEARCH 1997年 第2期46卷 153-167页
作者: Vial, JP Univ Geneva LOGILAB Management Studies CH-1211 Geneva 4 Switzerland
We propose a path-following version of the Todd-Burrell procedure to solve linear programming problems with an unknown optimal value. The path-following scheme is not restricted to Karmarkar's primal step;it can a... 详细信息
来源: 评论