Jul 2026· Proceedings of the Genetic and Evolutionary Computation Conference Companion· 0 citations· 21 references
TL;DR
This work proposes a Hybrid Augmented Lagrangian (HyAL) method that combines the constraint-handling capabilities of the AL framework with the exploratory power of population-based search, and demonstrates that HyAL effectively solves constrained optimization problems, including high-dimensional cases where population-based methods struggle.
Abstract
Constraint Optimization is crucial to fields such as engineering, economics, and robotics, where high-dimensional search spaces and complex constraints are common. Numerical optimization methods, like Interior Point and Sequential Quadratic Programming, achieve strong performance but rely on accurate gradients and good initialization, which are difficult to obtain. Evolutionary Algorithms (EAs) provide gradient-free search and robustness to complex landscapes, but suffer from high computational cost and slow convergence. In this work, we propose a Hybrid Augmented Lagrangian (HyAL) method that combines the constraint-handling capabilities of the AL framework with the exploratory power of population-based search. Evolutionary techniques are used to solve subproblems within the AL iterations, enhancing exploration and enabling escape from local optima. We evaluate four population-based methods within this framework and compare them against a state-of-the-art solver. Results demonstrate that HyAL effectively solves constrained optimization problems, including high-dimensional cases where population-based methods struggle.
This work proposes a Hybrid Augmented Lagrangian method that integrates the AL framework's constraint-handling strengths with the exploratory power of population-based search, and outperforms purely evolutionary approaches and scales more effectively to high-dimensional constrained problems, where evolutionary-only met...
Lampros Printzios, Konstantinos I. Chatzilygeroudis· arXiv.org· 0 citations
This study introduces a novel constrained multi-objective evolutionary algorithm, termed DPCME, which employs two interacting populations that exchange information, enabling effective global exploration and reducing the risk of convergence to local optima.
A unified and comprehensive perspective on constructing augmented Lagrangian functions (based on the Hestenes–Powell–Rockafellar augmented Lagrangian) for various optimization problems, including nonlinear programming and convex and nonconvex composite programming.
Experimental results on a well-known benchmark set demonstrate that this gradient-based approach minimizes the probability of relaxation failure, significantly enhancing pruning effectiveness and overall solver efficiency compared to the original strategy.
For solving nonconvex equality-constrained optimization problems, a recent Gradient-Eigenstep Algorithm by Goyens et al.~is an iteration-efficient approach, based on minimizing Fletcher's augmented Lagrangian function, for finding an approximate second-order stationary point from an arbitrary starting point. In this pa...
F. Curtis, Ling-Jun Guo, Daniel P. Robinson· 0 citations
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.