A redesign of Interior Point Methods (IPMs) for LP/QP problems will be addressed. Its objective is to avoid an explicit access to the problem data and to allow only matrix-vector products to be executed with the Hessian and Jacobian and its transpose. A use of iterative methods and a choice of suitable preconditioner to solve reduced Newton systems arising in optimization with IPMs will be discussed. A new fast preconditioner will be presented. Its numerical properties will be analysed and its use will be illustrated by computational results obtained for a collection of small to medium scale optimization problems (with no more than one million variables and with matrices limited to at most 10 million of nonzero elements).
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
