There are efficient and convergent interior point methods to solve linearly and nonlinearly constrained problems, one of these procedures being Vanderbei and Shanno's method. A simplification of it, here denoted the "naive" method, to solve linearly and nonlinearly constrained quadratic problems will be described, and also a restricted-step variant of it. Both procedures were implemented and tested on several realistic cases of short-term electric generation scheduling for problem sizes up to 13000 variables.
A convergence analysis is presented for the "naive" method. It is shown that nonlinear primal infeasibility and dual infeasibility at each iteration are bounded above by a quadratic with respect to step size, whereas primal and dual infeasibility decrease linearly for linearly constrained quadratic programming. The parameters of the quadratic bound in nonlinear primal and dual infeasibilities are related with the curvature of the nonlinear constraints. Computational tests performed conform to the theoretical developments described.
Numerical instability appears in the solution of some cases and it affects convergence. A numerical exemple is presented and the reasons for it are examined.
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
