Sparse quadratic programming in chemical process optimization
From MaRDI portal
Publication:2368094
Recommendations
Cites work
- A computational method for the indefinite quadratic programming problem
- A partial pivoting strategy for sparse symmetric matrix decomposition
- scientific article; zbMATH DE number 3984475 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- Inertia-Controlling Methods for General Quadratic Programming
- Numerically stable methods for quadratic programming
- Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Sparse Matrix Methods in Optimization
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(7)- Separation process optimization calculations
- Quadratic programming solver for structural optimisation using SQP algorithm
- scientific article; zbMATH DE number 1054668 (Why is no real title available?)
- scientific article; zbMATH DE number 1101648 (Why is no real title available?)
- scientific article; zbMATH DE number 4197288 (Why is no real title available?)
- A potential reduction algorithm for linearly constrained convex programming
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
This page was built for publication: Sparse quadratic programming in chemical process optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368094)