Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

被引：32
|
作者：
Yildirim, EA [1 ]
Todd, MJ [1 ]
机构：
[1] Cornell Univ, Sch Operat Res & Ind Engn, Ithaca, NY 14853 USA
来源：
MATHEMATICAL PROGRAMMING | 2001年 / 90卷 / 02期
关键词：
sensitivity analysis; interior-point methods; linear programming; semidefinite programming;
D O I：
10.1007/PL00011423
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We analyze perturbations of the right-hand side and the cost parameters in linear programming (LP) and semidefinite programming (SDP). We obtain tight bounds on the perturbations that allow interior-point method:, to recover feasible and near-optimal solutions in a single interior-point iteration. For the unique. nondegenerate solution case in LP, we show that the bounds obtained using interior-point methods compare nicely with the hounds arising from using the optimal basis. We also present explicit bounds for SDP using the Monteiro-Zhang family of search directions and specialize them to the AHO, H..K..M, and NT directions.
引用
收藏
页码：229 / 261
页数：33
相关论文
共 50 条
  • [31] A study of search directions in primal-dual interior-point methods for semidefinite programming
    Todd, MJ
    OPTIMIZATION METHODS & SOFTWARE, 1999, 11-2 (1-4): : 1 - 46
  • [32] Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
    Hayato Waki
    Maho Nakata
    Masakazu Muramatsu
    Computational Optimization and Applications, 2012, 53 : 823 - 844
  • [33] Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
    Waki, Hayato
    Nakata, Maho
    Muramatsu, Masakazu
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2012, 53 (03) : 823 - 844
  • [34] Toward probabilistic analysis of interior-point algorithms for linear programming
    1600, Inst of Management Sciences, Providence, RI, USA (19):
  • [35] Validated Infeasible Interior-Point Predictor–Corrector Methods for Linear Programming
    Ismail I. Idriss
    Wolfgang V. Walter
    Numerical Algorithms, 2004, 37 : 177 - 185
  • [36] Warm-start strategies in interior-point methods for linear programming
    Yildirim, EA
    Wright, SJ
    SIAM JOURNAL ON OPTIMIZATION, 2002, 12 (03) : 782 - 810
  • [37] INTERIOR-POINT METHODS FOR CONVEX-PROGRAMMING
    JARRE, F
    APPLIED MATHEMATICS AND OPTIMIZATION, 1992, 26 (03): : 287 - 311
  • [38] Mixed integer nonlinear programming using interior-point methods
    Benson, Hande Y.
    OPTIMIZATION METHODS & SOFTWARE, 2011, 26 (06): : 911 - 931
  • [39] Interior-point algorithm for semidefinite programming based on a logarithmic kernel function
    Benterki, Djamel
    Yassine, Adnan
    Zerari, Amina
    BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE, 2021, 64 (01): : 3 - 15
  • [40] A primal-dual regularized interior-point method for semidefinite programming
    Dehghani, A.
    Goffin, J. -L.
    Orban, D.
    OPTIMIZATION METHODS & SOFTWARE, 2017, 32 (01): : 193 - 219
12345