34 search results - page 1 / 7 » A tailored inexact interior-point method for systems analysi... |
SIAMSC
2010
12 years 11 months ago
2010
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Inste...
CDC
2010
IEEE
12 years 12 months ago
2010
IEEE
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
CDC
2008
IEEE
13 years 11 months ago
2008
IEEE
SIAMJO
2008
13 years 4 months ago
2008
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...