Sequential Bound Constrained Minimization Method for Solving Complex Process System Optimization Problems

Steady-state optimization of complex process systems in engineering practice is a typical class of large-scale optimization problems. In this paper, we propose a new method, Sequential Bound Constrained Minimization (SBCM) method, for solving such optimization problems. Specifically, by introducing relaxation variables properly into engineering optimization model, the derived penalty function encompasses only penalty items related to equality constraints, excluding those pertaining to bound and inequality constraints. The solution to the original optimization problem is obtained through solving a series of bound constrained subproblems instead of a series of unconstrained subproblems. Furthermore, a modified truncated-Newton method is provided to solve the bound constrained subproblems. Finally, numerical simulations are conducted on two nonlinear optimization problems with varying dimensions and the simulation results demonstrate the stability and effectiveness of the proposed method.

Authors

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2026-02-01
DOI
https://doi.org/10.6180/jase.202607_30.036
Primary Topic
Process Optimization and Integration
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Sequential Bound Constrained Minimization Method for Solving Complex Process System Optimization Problems

Chunyan Li, Xiang Li
SHILAP Revista de lepidopterología
Process Optimization and Integration
article

Sequential Bound Constrained Minimization Method for Solving Complex Process System Optimization Problems

Chunyan Li, Xiang Li
article en

Abstract

Steady-state optimization of complex process systems in engineering practice is a typical class of large-scale optimization problems. In this paper, we propose a new method, Sequential Bound Constrained Minimization (SBCM) method, for solving such optimization problems. Specifically, by introducing relaxation variables properly into engineering optimization model, the derived penalty function encompasses only penalty items related to equality constraints, excluding those pertaining to bound and inequality constraints. The solution to the original optimization problem is obtained through solving a series of bound constrained subproblems instead of a series of unconstrained subproblems. Furthermore, a modified truncated-Newton method is provided to solve the bound constrained subproblems. Finally, numerical simulations are conducted on two nonlinear optimization problems with varying dimensions and the simulation results demonstrate the stability and effectiveness of the proposed method.

SHILAP Revista de lepidopterología
Yulin Normal University (CN), Guangzhou Vocational College of Science and Technology (CN)
Reduced inequalities
Openalex Percentile: Top 63%
Process Optimization and Integration
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Sequential Bound Constrained Minimization Method for Solving Complex Process System Optimization Problems — Chunyan Li, Xiang Li · SHILAP Revista de lepidopterología (2026) | TGRS Research Map | TGRS