General algorithm for analytical calculations of Jacobi matrix elements in sparse nonlinear programming problems

DOI10.3103/S0278641922040082zbMATH Open1519.90236OpenAlexW4391241014MaRDI QIDQ6043892FDOQ6043892

Authors: D. V. Zlobin 

Publication date: 25 May 2023

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641922040082

Recommendations

• Estimation of Sparse Jacobian Matrices
• Software for estimating sparse Jacobian matrices
• A sparse nonlinear optimization algorithm
• Class of optimization algorithms for the solution of large nonlinear programming problems. II
• Computing sparse Jacobian matrices optimally

zbMATH Keywords

nonlinear programmingnumerical solutionsymbolic mathematicsJacobian matrix of constraintsspeed-efficient codevariables with indices

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Fast Direct Multiple Shooting Algorithms for Optimal Robot Control
• Nonlinear Programming

Cited In (2)

• DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
• Title not available (Why is that?)

This page was built for publication: General algorithm for analytical calculations of Jacobi matrix elements in sparse nonlinear programming problems

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