On effectively computing the analytic center of the solution set by primal-dual interior-point methods

被引：0
|
作者：
Gonzalez, MD
Tapia, RA
Potra, FA
机构：
[1] Univ Simon Bolivar, Dept Comp Cient & Estadist, Caracas 1080A, Venezuela
[2] Univ Simon Bolivar, Ctr Estadist & Software Matemat, Caracas 1080A, Venezuela
[3] Rice Univ, Dept Computat & Appl Math, Houston, TX 77251 USA
[4] Rice Univ, Ctr Res Parallel Computat, Houston, TX 77251 USA
[5] Univ Iowa, Dept Math, Iowa City, IA 52242 USA
[6] Univ Iowa, Dept Comp Sci, Iowa City, IA 52242 USA
来源：
SIAM JOURNAL ON OPTIMIZATION | 1998年 / 8卷 / 01期
关键词：
primal-dual interior-point algorithm; analytic-center solution; linear programming;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The computation of the analytic center of the solution set can be important in linear programming applications where it is desirable to obtain a solution that is not near the relative boundary of the solution set. In this work we discuss the effective computation of the analytic center solution by the use of primal-dual interior-point methods. A primal-dual interior-point algorithm designed for effectively computing the analytic-center solution is proposed, and theory and numerical results are presented.
引用
下载
收藏
页码：1 / 25
页数：25
相关论文
共 50 条
  • [1] On the convergence of primal-dual interior-point methods with wide neighborhoods
    Tuncel, Levent, 1600, Kluwer Academic Publishers, Dordrecht, Netherlands (04):
  • [2] ON THE CONVERGENCE OF THE ITERATION SEQUENCE IN PRIMAL-DUAL INTERIOR-POINT METHODS
    TAPIA, RA
    ZHANG, Y
    YE, YY
    MATHEMATICAL PROGRAMMING, 1995, 68 (02) : 141 - 154
  • [3] Parabolic target space and primal-dual interior-point methods
    Nesterov, Yu.
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (11) : 2079 - 2100
  • [4] SEMIDEFINITE PROGRAMMING: FORMULATIONS AND PRIMAL-DUAL INTERIOR-POINT METHODS
    Fukuda, Mituhiro
    Nakata, Maho
    Yamashita, Makoto
    REDUCED-DENSITY-MATRIX MECHANICS - WITH APPLICATION TO MANY-ELECTRON ATOMS AND MOLECULES, 2007, 134 : 103 - 118
  • [5] Dual versus primal-dual interior-point methods for linear and conic programming
    M. J. Todd
    Mathematical Programming, 2008, 111 : 301 - 313
  • [6] Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
    Fujisawa, Katsuki
    Kojima, Masakazu
    Nakata, Kazuhide
    Mathematical Programming, Series B, 1997, 79 (1-3): : 235 - 253
  • [7] Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
    Katsuki Fujisawa
    Masakazu Kojima
    Kazuhide Nakata
    Mathematical Programming, 1997, 79 : 235 - 253
  • [8] Long-step strategies in interior-point primal-dual methods
    Yu. Nesterov
    Mathematical Programming, 1997, 76 : 47 - 94
  • [9] Long-step strategies in interior-point primal-dual methods
    Nesterov, Yu.
    Mathematical Programming, Series B, 1997, 76 (01): : 47 - 94
  • [10] Primal-dual interior-point methods for PDE-constrained optimization
    Ulbrich, Michael
    Ulbrich, Stefan
    MATHEMATICAL PROGRAMMING, 2009, 117 (1-2) : 435 - 485
12345