„Interior Point Methods“

Suchergebnisse

221 Treffer

• A globally convergent primal—dual interior point algorithm for convex programming
  Monteiro, Renato D. C.
• An interior point algorithm to solve computationally difficult set covering problems
  Karmarkar, Narendra ; Resende, Mauricio G. C. ; Ramakrishnan, K. G.
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
  Wächter, Andreas ; Biegler, Lorenz T.
• Superlinear convergence of infeasible-interior-point methods for linear programming
  Zhang, Yin ; Zhang, Detong
• Interior-point algorithms for semi-infinite programming
  Todd, Michael J.
• A little theorem of the bigℳ in interior point algorithms
  Kojima, Masakazu ; Mizuno, Shinji ; Yoshise, Akiko
• An active-set strategy in an interior point method for linear programming
  Tone, Kaoru
• Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs
  Kojima, Masakazu ; Shida, Masayuki ; Shindoh, Susumu
• Symmetric indefinite systems for interior point methods
  Vanderbei, Robert J. ; Carpenter, Tamra J.
• Balinski—Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
  Tijssen, Gert A. ; Sierksma, Gerard
• A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
  Monteiro, Renato DC ; Zhang, Yin
• Theoretical convergence of large-step primal—dual interior point algorithms for linear programming
  Kojima, Masakazu ; Megiddo, Nimrod ; Mizuno, Shinji
• A modified layered-step interior-point algorithm for linear programming
  Megiddo, Nimrod ; Mizuno, Shinji ; Tsuchiya, Takashi
• Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem
  Freund, Robert M.
• Convergence behavior of interior-point algorithms
  Güler, Osman ; Ye, Yinyu
• On the finite convergence of interior-point algorithms for linear programming
  Ye, Yinyu
• Global convergence in infeasible-interior-point algorithms
  Kojima, Masakazu ; Noma, Toshihito ; Yoshise, Akiko
• A combinatorial interior point method for network flow problems
  Wallacher, C. ; Zimmermann, U.
• An interior point algorithm of $$O(\sqrt m \left/ {\ln \varepsilon } \right/)$$ iterations forC 1-convex programming
  Sun, Jie ; Qi, Liqun
• Interior-point methods for convex programming
  Jarre, Florian