Numerical Continuation and Singularity Detection Methods for Parametric Nonlinear Programming

From MaRDI portal





The numerical continuation and singularity detection methods investigated in this paper are based on a transformation of the nonlinear programming problem into a nonlinear system. This is done using the Fritz-John necessary optimality conditions and the active set. It also involves a nonstandard normalization of the Lagrange multipliers. After the discussion of this transformation, the paper continues with a presentation of numerical methods that can be used to solve the linear systems arising in a predictor corrector continuation. These methods are based on the Schur complement and the bordering algorithm and include symmetric factorization, the null space, and the range space method. This presentation is followed by a discussion of critical point types and by a comprehensive study of singularity detection. It is shown how the information computed previously can be used to perform these tasks efficiently. The paper concludes with an illustration of these techniques using a model problem from design optimization.





Describes a project that uses

Uses Software






This page was built for publication: Numerical Continuation and Singularity Detection Methods for Parametric Nonlinear Programming

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