A primal-dual interior-point algorithm for nonlinear least squares constrained problems
This paper extends prior work by the authors on solving nonlinear least squares unconstrained problems using a factorized quasi-Newton technique. With this aim we use a primal-dual interior-point algorithm for nonconvex nonlinear program- ming. The factorized quasi-Newton technique is now applied to...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2005
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/1822/5415 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/5415 |