An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms

From MaRDI portal





The authors derive a primal-dual interior point algorithm for the problem of minimizing a sum of Euclidean norms, by applying Newton's method directly to a system of nonlinear equations characterizing primal and dual feasibility and a perturbed complementarity condition. The main work at each step consists of solving a system of linear equations (the Schur complement equations). This Schur complement matrix is not symmetric, unlike in linear programming. A Mehrotra-type predictor-corrector scheme and some experimental results comparing several variations of the algorithm are presented. Results obtained from a code implemented to solve large sparse problems, using a symmetrized Schur complement are also presented. The method is applied to problems arising in plastic collapse analysis, with hundreds of thousands of variables and millions of nonzeros in the constraint matrix.




Cited in
(49)








This page was built for publication: An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4509980)