2026-06-01T19:49:21Zhttps://riuma.uma.es/rest/oai/request

oai:riuma.uma.es:10630/398322026-02-03T12:32:15Zcom_10630_2254col_10630_37959

On optimization over a polyhedral set and Augmented Lagrangians. Hendrix, Eligius María Theodorus Guerrero-García, Pablo Rocha, Ana Maria A.C. Lagrange, Funciones de Programación lineal Linear constraints have a long tradition in optimization problems. It means that the feasible set is a polyhedral set or can be described as a polytope. In Global Optimization,we use the characteristics to derive specific algorithms. In our contribution,wewill focus on the so-called Augmented Lagrangian approach where constraints are captured in Lagrangian terms and penalties.We show some first numerical analysis with the easiest case of having a linear objective. 2025-09-11T06:37:27Z 2025-09-11T06:37:27Z 2025 conference output https://hdl.handle.net/10630/39832 eng XVI Workshop on Global Optimization, STOGO 2025 Stockholm 2-5 septiembre 2025 http://creativecommons.org/licenses/by-nd/4.0/ open access Attribution-NoDerivatives 4.0 Internacional Kungliga Tekniska högskolan