Skip Navigation

Applied Mathematics Research eXpress (2005) Vol. 2005 : article ID 1, 10 pages, doi:10.1155/AMRX.2005.1
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow How to cite this article
Google Scholar
Right arrow Articles by Nie, P.-y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2005 Hindawi Publishing Corporation. All rights reserved.

A self-adaptive penalty approach for nonlinear programming

Pu-yan Nie

For penalty approaches, it is extremely difficult to choose penalty parameter and penalty term to avoid ill-conditions. In this work, penalty techniques fornonlinear programming problems are revisited. A new penalty approach, which is called self-adaptive penalty method, is proposed. When penalty parameter and penalty term are considered, we adjust them according to the feedback information at each step (and the previous steps) in the new method so that the second information of the subproblem may be a semidefinite positive matrix whose conditioned number is not too large.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.