• Home
  • Search
  • Efficient Solution of Dynamic Optimization and NMPC Problems
  • Cite Icon140
  • https://doi.org/10.1007/978-3-0348-8407-5_13Copy DOI Icon

Efficient Solution of Dynamic Optimization and NMPC Problems

  • Jan 1, 2000
  • Lorenz T Biegler
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Abstract Large scale optimization strategies have evolved considerably over the past two decades. Currently, continuous variable optimization problems (nonlinear programs) are solved on-line for steady state refinery models with several hundred thousand variables. Moreover, efficient NLP strategies have been developed for dynamic optimization problems. Still, to take the next step, on-line optimization of large dynamic chemical processes, a number of limitations and research challenges must be overcome. Many of the advances in NLP algorithms have taken place by recognizing and exploiting the framework of Successive Quadratic Programming (SQP) algorithms. These are extensions of Newton type methods for converging to the solution of the KKT (optimality) conditions of the optimization problem. Because of this, fast convergence can be expected and a number of standard devices can be added to stabilize the algorithm to converge from poor starting points. Limitations of these Newton-based methods are also well-known. They experience difficulties in the presence of ill conditioning and extreme nonlinearities. Also, for optimization algorithms, nonconvexity can also lead to a number of difficulties and there is a need for software that allows exploitable structures for specific problem classes. A number of innovations in algorithm design and problem formulation address these issues and greatly improve performance. As a result, very fast NLP algorithms can be derived for data reconciliation, parameter estimation, nonlinear model predictive control and dynamic optimization. Moreover, inequality constraints and variable bounds can be treated through advances in interior point strategies. These methods preserve the particular problem structure and scale well in performance for large-scale problems with many constraints. Finally, the ability to solve nonlinear programs quickly also allows us to consider more challenging problems. These include the extension to solving nonconvex NLPs globally and the ability to assess the solution’s tolerance to uncertainty by considering features of nonlinear programming sensitivity analysis and robust optimization through flexibility analysis and design.

Similar Papers
  • Research Article
  • Citations24

Nonlinear programming strategies for dynamic chemical process optimization

  • Sep 01, 2014
  • Theoretical Foundations of Chemical Engineering
  • Lorenz T Biegler
  • Research Article
  • Citations25

Novel Optimization Model and Efficient Solution Method for Integrating Dynamic Optimization with Process Operations of Continuous Manufacturing Processes

  • Feb 12, 2015
  • Industrial & Engineering Chemistry Research
  • Hanyu Shi +2
  • PDF
  • Research Article
  • Citations17

Global dynamic optimization with Hammerstein–Wiener models embedded

  • Feb 23, 2022
  • Journal of Global Optimization
  • Chrysoula D Kappatou +4
  • Conference Article
  • Citations15

Implementation of advanced control for a heat-integrated distillation column system

  • Nov 02, 2004
  • Xuemei Zhu +2
  • Research Article
  • Citations30

Economic Nonlinear Model Predictive Control for Flexible Operation of Air Separation Units

  • Jan 01, 2018
  • IFAC-PapersOnLine
  • Adrian Caspari +4
  • Research Article
  • Citations12

Sensitivity-based adaptive mesh refinement collocation method for dynamic optimization of chemical and biochemical processes.

  • Jun 07, 2017
  • Bioprocess and Biosystems Engineering
  • Long Xiao +8
  • Conference Article
  • Citations15

New Dynamic Multiobjective Evolutionary Algorithm with Core Estimation of Distribution

  • Jun 01, 2010
  • Chun-An Liu
  • Research Article
  • Citations8

Multi-objective structure dynamic optimization based on equivalent static loads

  • Jun 02, 2017
  • International Journal on Interactive Design and Manufacturing (IJIDeM)
  • Hui Ma +3
  • Research Article
  • Citations44

Interior point SQP strategies for large-scale, structured process optimization problems

  • May 01, 1999
  • Computers & Chemical Engineering
  • Joao Albuquerque +4
  • Research Article
  • Citations136

Dynamic Optimization of Nonlinear Processes with an Enhanced Scatter Search Method

  • Apr 03, 2009
  • Industrial & Engineering Chemistry Research
  • Jose A Egea +3
  • Research Article
  • Citations27

Nonlinear Dynamic Response Structural Optimization of a Joined-Wing Using Equivalent Static Loads

  • May 01, 2009
  • Journal of Aircraft
  • Y I Kim +4
  • PDF
  • Research Article
  • Citations117

New Noise-Tolerant Neural Algorithms for Future Dynamic Nonlinear Optimization With Estimation on Hessian Matrix Inversion

  • Apr 01, 2021
  • IEEE Transactions on Systems, Man, and Cybernetics: Systems
  • Lin Wei +4
  • Research Article

A subset-selection-based derivative-free optimization algorithm for dynamic operation optimization in a steel-making process

  • Oct 13, 2022
  • Engineering Optimization
  • Yongxia Liu +4
  • Conference Article

Ultrafast Learning-Based Nonlinear Model Predictive Control and its Embedded Realization

  • Dec 20, 2021
  • Shaunak Ghatpande +5
  • Research Article
  • Citations49

Optimization of grade transitions in polyethylene solution polymerization process under uncertainty

  • Aug 31, 2016
  • Computers & Chemical Engineering
  • Jun Shi +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.