Program for stream Interior-point algorithms

WE-07: IPA 1 - Linear optimization and complementarity problems
Stream: Interior-point algorithms
Room: 108
Chair(s): Zsolt Darvay

• Interior point methods are not (much) worse than Simplex
  Laszlo Vegh
• The class of sufficient matrices
  Marianna E.-Nagy
• A new long-step interior-point framework for solving sufficient linear complementarity problems
  Anita Varga, Marianna E.-Nagy

TA-07: IPA 2 - Search directions for interior-point algorithms
Stream: Interior-point algorithms
Room: 108
Chair(s): Marianna E.-Nagy

• Predictor-corrector interior-point algorithms based on a new class of algebraically equivalent transformations
  Petra Renáta Rigó, Tibor Illés, Roland Török
• Implementation of predictor-corrector interior-point algorithms for solving sufficient linear complementarity problems
  Roland Török, Tibor Illés, Petra Renáta Rigó
• Predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
  Zsolt Darvay, Petra Renáta Rigó

TB-01: IPA 3 - Advances in interior-point methods
Stream: Interior-point algorithms
Room: C V
Chair(s): Goran Lesaja

• A predictor-corrector interior-point algorithm with new search directions for sufficient weighted linear complementarity problems
  Xiaoni Chi, Guoqiang Wang, Goran Lesaja
• Kernel-based full-Newton step interior-point algorithm for $P_ {*}(\kappa)$-WLCP
  Goran Lesaja, Xiaoni Chi, Guoqiang Wang, Florian Potra
• Set-Limited Functions and Polynomial-Time Interior-Point Methods
  Yurii Nesterov