Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear".
Autor(a) principal: | |
---|---|
Data de Publicação: | 2023 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNIFESP |
dARK ID: | ark:/48912/001300000n8hx |
Texto Completo: | https://hdl.handle.net/11600/71352 |
Resumo: | In the paper [Torrealba, E.M.R. et al. Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem. EJOR, 299(1) 46–59, 2021] an augmented Lagrangian algorithm was proposed for resource allocation problems with the intriguing characteristic that instead of solving the box-constrained augmented Lagrangian subproblem, they propose projecting the solution of the unconstrained subproblem onto such box. A global convergence result for the quadratic case was provided, however, this is somewhat counterintuitive, as in usual augmented Lagrangian theory, this strategy can fail in solving the augmented Lagrangian subproblems. In this note we investigate further this algorithm and we show that the proposed method may indeed fail when the Hessian of the quadratic is not a multiple of the identity. In the paper, it is not clear enough that two different projections are being used: one for obtaining their convergence results and other in their implementation. However, despite the lack of theoretical convergence, their strategy works remarkably well in some classes of problems; thus, we propose a hybrid method which uses their idea as a starting point heuristics, switching to a standard augmented Lagrangian method under certain conditions. Our contribution consists in presenting an efficient way of determining when the heuristics is failing to improve the KKT residual of the problem, suggesting that the heuristic procedure should be abandoned. Numerical results are provided showing that this strategy is successful in accelerating the standard method. |
id |
UFSP_7d07aa9e73e0a491c88c9444c6a31085 |
---|---|
oai_identifier_str |
oai:repositorio.unifesp.br/:11600/71352 |
network_acronym_str |
UFSP |
network_name_str |
Repositório Institucional da UNIFESP |
repository_id_str |
3465 |
spelling |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear".On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”Nonlinear programmingResource allocation problemAugmented Lagrangian method.In the paper [Torrealba, E.M.R. et al. Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem. EJOR, 299(1) 46–59, 2021] an augmented Lagrangian algorithm was proposed for resource allocation problems with the intriguing characteristic that instead of solving the box-constrained augmented Lagrangian subproblem, they propose projecting the solution of the unconstrained subproblem onto such box. A global convergence result for the quadratic case was provided, however, this is somewhat counterintuitive, as in usual augmented Lagrangian theory, this strategy can fail in solving the augmented Lagrangian subproblems. In this note we investigate further this algorithm and we show that the proposed method may indeed fail when the Hessian of the quadratic is not a multiple of the identity. In the paper, it is not clear enough that two different projections are being used: one for obtaining their convergence results and other in their implementation. However, despite the lack of theoretical convergence, their strategy works remarkably well in some classes of problems; thus, we propose a hybrid method which uses their idea as a starting point heuristics, switching to a standard augmented Lagrangian method under certain conditions. Our contribution consists in presenting an efficient way of determining when the heuristics is failing to improve the KKT residual of the problem, suggesting that the heuristic procedure should be abandoned. Numerical results are provided showing that this strategy is successful in accelerating the standard method.Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)2021/05007-02018/24293-02013/07375-0Steffen Rebennackhttp://lattes.cnpq.br/0017683968952439Bueno, Luís Felipe [UNIFESP]Haeser, GabrielKolossoski, Oliver2024-07-05T11:53:43Z2024-07-05T11:53:43Z2023-08-20info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamapplication/octet-streamhttps://hdl.handle.net/11600/71352ark:/48912/001300000n8hxengEuropean Journal of Operational Researchinfo:eu-repo/semantics/openAccessreponame:Repositório Institucional da UNIFESPinstname:Universidade Federal de São Paulo (UNIFESP)instacron:UNIFESP2024-08-14T01:56:39Zoai:repositorio.unifesp.br/:11600/71352Repositório InstitucionalPUBhttp://www.repositorio.unifesp.br/oai/requestbiblioteca.csp@unifesp.bropendoar:34652024-12-11T20:26:52.104251Repositório Institucional da UNIFESP - Universidade Federal de São Paulo (UNIFESP)false |
dc.title.none.fl_str_mv |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem” |
title |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". |
spellingShingle |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". Bueno, Luís Felipe [UNIFESP] Nonlinear programming Resource allocation problem Augmented Lagrangian method. |
title_short |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". |
title_full |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". |
title_fullStr |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". |
title_full_unstemmed |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". |
title_sort |
Um artigo sobre "Algoritmos de Lagrangiano aumentado para resolver o problema contínuo de alocação de recursos não linear". |
author |
Bueno, Luís Felipe [UNIFESP] |
author_facet |
Bueno, Luís Felipe [UNIFESP] Haeser, Gabriel Kolossoski, Oliver |
author_role |
author |
author2 |
Haeser, Gabriel Kolossoski, Oliver |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
http://lattes.cnpq.br/0017683968952439 |
dc.contributor.author.fl_str_mv |
Bueno, Luís Felipe [UNIFESP] Haeser, Gabriel Kolossoski, Oliver |
dc.subject.por.fl_str_mv |
Nonlinear programming Resource allocation problem Augmented Lagrangian method. |
topic |
Nonlinear programming Resource allocation problem Augmented Lagrangian method. |
description |
In the paper [Torrealba, E.M.R. et al. Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem. EJOR, 299(1) 46–59, 2021] an augmented Lagrangian algorithm was proposed for resource allocation problems with the intriguing characteristic that instead of solving the box-constrained augmented Lagrangian subproblem, they propose projecting the solution of the unconstrained subproblem onto such box. A global convergence result for the quadratic case was provided, however, this is somewhat counterintuitive, as in usual augmented Lagrangian theory, this strategy can fail in solving the augmented Lagrangian subproblems. In this note we investigate further this algorithm and we show that the proposed method may indeed fail when the Hessian of the quadratic is not a multiple of the identity. In the paper, it is not clear enough that two different projections are being used: one for obtaining their convergence results and other in their implementation. However, despite the lack of theoretical convergence, their strategy works remarkably well in some classes of problems; thus, we propose a hybrid method which uses their idea as a starting point heuristics, switching to a standard augmented Lagrangian method under certain conditions. Our contribution consists in presenting an efficient way of determining when the heuristics is failing to improve the KKT residual of the problem, suggesting that the heuristic procedure should be abandoned. Numerical results are provided showing that this strategy is successful in accelerating the standard method. |
publishDate |
2023 |
dc.date.none.fl_str_mv |
2023-08-20 2024-07-05T11:53:43Z 2024-07-05T11:53:43Z |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://hdl.handle.net/11600/71352 |
dc.identifier.dark.fl_str_mv |
ark:/48912/001300000n8hx |
url |
https://hdl.handle.net/11600/71352 |
identifier_str_mv |
ark:/48912/001300000n8hx |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
European Journal of Operational Research |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream application/octet-stream |
dc.publisher.none.fl_str_mv |
Steffen Rebennack |
publisher.none.fl_str_mv |
Steffen Rebennack |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UNIFESP instname:Universidade Federal de São Paulo (UNIFESP) instacron:UNIFESP |
instname_str |
Universidade Federal de São Paulo (UNIFESP) |
instacron_str |
UNIFESP |
institution |
UNIFESP |
reponame_str |
Repositório Institucional da UNIFESP |
collection |
Repositório Institucional da UNIFESP |
repository.name.fl_str_mv |
Repositório Institucional da UNIFESP - Universidade Federal de São Paulo (UNIFESP) |
repository.mail.fl_str_mv |
biblioteca.csp@unifesp.br |
_version_ |
1818602488497963008 |