Authors: Martin Peter Neuenhofen
We present an NLP solver for nonlinear optimization with quadratic penalty terms and logarithmic barrier terms. The method is suitable for large sparse problems. Each iteration has a polynomial time-complexity. The method has global convergence and local quadratic convergence, with a convergence radius that depends little on our method but rather on the geometry of the problem.
Comments: 16 Pages.
[v1] 2018-10-26 02:32:17
Unique-IP document downloads: 43 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.