Process industries increasingly face large-scale nonlinear programs with high dimensionality and tight constraints. This study reports on the design and implementation of a reduced-space sequential quadratic programming (RSQP) solver for such settings. The solver couples a column-reordering space-decomposition strategy with sparse-matrix storage/kernels, and is implemented in a modular C++ framework that supports range/null-space splitting, line search, and convergence checks. We evaluate six small-scale benchmarks with non-convex/exponential characteristics, a set of variable-dimension tests up to 128 k variables, and an industrial reverse-osmosis (RO) optimization. On small problems, RSQP attains an accuracy comparable to a full-space sequential quadratic programming (SQP) baseline. In variable-dimension tests, the solver shows favorable scaling when moving from 64 k to 128 k variables; under dynamically varying degrees of freedom, the iteration count decreases by about 62% with notable time savings. In the RO case, daily operating cost decreases by 4.98% and 1.46% across two scenarios while satisfying water-quality constraints. These results indicate that consolidating established RSQP components with column reordering and sparse computation yields a practical, scalable solver for large-scale process optimization.
The dynamic simulation of the continuous catalytic reforming process is of great significance to the performance prediction and optimization of the entire process. In this study, a 34-lumped mechanism model described by differential algebra was established based on the actual process conditions of the continuous catalytic reforming process in China, and an efficient dynamic simulation solution method based on simultaneous equations was proposed. First, a 34-lumped differential–algebraic mechanism model was established based on the basic principles of reforming kinetics, thermodynamics, material balance, and energy balance. Secondly, in order to solve and simulate the mechanism model composed of 144 differential equations and several algebraic equations, the method of finite-element collocation is used to discretize the differential equations and convert them into large-scale, nonlinear programming problems, and the interior point algorithm is used to estimate its parameters and verify the model. In addition, in order to avoid the problem of too long derivative solution time and too large memory in the solution process, methods such as sparse derivative and Broyden–Fletcher–Goldfarb–Shanno (BFGS) with limited storage are used to solve the problem. Finally, on the basis of model verification, dynamic simulation and sensitivity analysis of the whole process are carried out by modifying different input parameters. The results show that the mechanism model and solution method presented in this paper can quickly and accurately simulate the continuous catalytic reforming process dynamically.