A New Filter SQP Algorithm for Inequality Constrained Optimization
Chungen Shen
Abstract
Chungen Shen
Abstract
The paper introduces a new filter SQP algorithm based on line search technique.This algorithm uses neither a penalty function nor a restoration phase.The global convergence is proved under some mild conditions.We do some improvement of the acceptance conditions of the line search filter so that the trial steps can be accepted easily.Numerical results are presented that confirm the robustness of our algorithm.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper introduces a new filter SQP algorithm based on line search technique.This algorithm uses neither a penalty function nor a restoration phase.The global convergence is proved under some mild conditions.We do some improvement of the acceptance conditions of the line search filter so that the trial steps can be accepted easily.Numerical results are presented that confirm the robustness of our algorithm.
Key concepts: Sequential quadratic programming, Robustness (evolution), Mathematical optimization, Penalty method, Line search, Convergence (economics), Filter (signal processing), Algorithm