This talk will be based on a paper by Dominguez and Gonzalez-Lima where a primal-dual interior-point method for (large, sparse) quadratic programming problems is proposed. The method relies on a reduction presented by Gonzalez-Lima, Wei, and Wolkowicz in order to solve the linear systems arising in the primal-dual methods for linear programming. The main features of this reduction is that it is well defined at the solution set and it preserves sparsity. These properties add robustness and stability to the algorithm and very accurate solutions can be obtained. We describe the method and we consider different reductions using the same framework. We discuss the relationship of our proposals and the one used in the LOQO code. We compare and study the different approaches by performing numerical experimentation.
Current 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996