%0 Journal Article
%T An SQP Method with a Revised Non--Monotone Line Search<br>一种修改的非单调线搜索SQP算法
%A Xue Wenjuan
%A Shen Chungen
%A <br>薛文娟
%A 沈春根
%J 系统科学与数学
%D 2007
%I 
%X In the paper introduces a kind of revised non--monotone line search SQP method for constrained NLP problems is introduced, and the global convergence of this method is proved without using a penalty function as a merit function, a filter or the feasibility restoration phase. This method is based on the concept of multi--objective optimization: a trial point can be accepted if and only if either object function value decreases or the measure of violation constraints decreases. Numerical results, compared with LANCELOT, show that the approach is effective.
%K SQP<br>非线性规划
%K 全局收敛性
%K 线搜索
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=A1A684EF52601549D798EF9C2803D081&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=B31275AF3241DB2D&sid=3019419AF3C0F2FB&eid=40541F483644ACC4&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=29