An exact primal–dual penalty method approach to warmstarting interior-point methods for linear programming

This publication has 16 references indexed in Scilit:

• Interior-Point Algorithms, Penalty Methods and Equilibrium Problems
  Computational Optimization and Applications, 2006
• Interior Methods for Mathematical Programs with Complementarity Constraints
  SIAM Journal on Optimization, 2006
• Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing
  Mathematical Programming, 2004
• Reoptimization With the Primal-Dual Interior Point Method
  SIAM Journal on Optimization, 2002
• Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming
  Computational Optimization and Applications, 2001
• Warm Start and ε-Subgradients in a Cutting Plane Scheme for Block-Angular Linear Programs
  Computational Optimization and Applications, 1999
• Warm start of the primal-dual method applied in the cutting-plane scheme
  Mathematical Programming, 1998
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
  INFORMS Journal on Computing, 1994
• A primal—dual infeasible-interior-point algorithm for linear programming
  Mathematical Programming, 1993
• Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
  Linear Algebra and its Applications, 1991