A globally convergent primal-dual interior-point filter method for nonlinear programming
In this paper, the filter technique of Fletcher and Leyffer (1997) is used to globalize the primal-dual interior-point algorithm for nonlinear programming, avoiding the use of merit functions and the updating of penalty parameters. The new algorithm decomposes the primal-dual step obtained from the...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2004
|
| Texto completo: | http://hdl.handle.net/10316/7764 |
| País: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/7764 |