Cart (Loading....) | Create Account
Close category search window
 

A Modified Filter Trust Region Method for Nonlinear Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Su Ke ; Tongji Univ., Shanghai

Sequential quadratic programming (SQP) type method is one of the most effective methods for solving nonlinear programming. Recently, filter method, for its good numerical results, are extensively studied to handle nonlinear programming problems. In this paper, a new modified approach combined the filter technique and SQP trust region method is proposed to tackle the original problem, which ensures that every trail point will not be far away from the feasible region. Global convergence results of the proposed algorithm are established under suitable conditions. Some numerical results are reported in this paper.

Published in:

Control Conference, 2007. CCC 2007. Chinese

Date of Conference:

July 26 2007-June 31 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.