1 - 4 of 4 articles
Nonlinear optimization algorithms are rarely discussed from a complexity point of view. Even the concept of solving nonlinear problems on digital computers is not well defined. The focus here is on a complexity approach for designing and analyzing algorithms for nonlinear optimization problems...
In this paper, we give three polynomial algorithms which detect a kernel in comparability graphs relatively to an M-orientation, in permutation graphs and in P
4-free graphs with a normal orientation.
In this paper, we examine the sensitivity of trust-region algorithms on the parameters related to the step acceptance and update of the trust region. We show, in the context of unconstrained programming, that the numerical efficiency of these algorithms can easily be improved by choosing...
This is a summary of the most important results presented in the author's PhD thesis (Wong 2004). This thesis, written in English, was defended on 14 June 2004 at the Katholieke Universiteit Leuven (Belgium) and supervised by Dirk Cattrysse and Dirk Van Oudheusden. A copy is available from the...
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.