Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms

• URL: http://arxiv.org/abs/2607.16876v1
• Date: Sat, 18 Jul 2026 16:29:06 GMT
• Title: Hybrid Augmented Lagrangian Method for General Constrained Optimization via Evolutionary Algorithms
• Abstract summary: We propose a Hybrid Augmented Lagrangian (HyAL) method that integrates the AL framework's constraint-handling strengths with the exploratory power of population-based search.<n>Our approach employs evolutionary techniques to solve subproblems within the AL iterations, promoting exploration and aiding in the escape from local optima.<n>Our results show that HyAL consistently produces high-quality solutions across the benchmark suite.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Constrained Optimization Problems are crucial in fields such as engineering, economics, and robotics, where high-dimensional search spaces and complex objectives and constraints are common. Numerical optimization methods, including Feasible Direction, Interior Point, and Sequential Quadratic Programming, have shown strong performance in finding feasible local optima, but require accurate analytical gradients and effective initialization, which can be challenging in real-world settings. Evolutionary Algorithms, on the other hand, offer gradient-free search and robustness to noisy landscapes, managing to detect global optima more often than numerical methods, but they often suffer from high computational costs and slow convergence. In this work, we propose a Hybrid Augmented Lagrangian (HyAL) method that integrates the AL framework's constraint-handling strengths with the exploratory power of population-based search. Our approach employs evolutionary techniques to solve subproblems within the AL iterations, promoting exploration and aiding in the escape from local optima. We conduct extensive experiments on benchmark optimization problems, comparing our method against state-of-the-art optimizers, including IPOPT and CMA-ES, and a standalone evolutionary optimization baseline (with constraint enforcement via penalties). In addition, we evaluate four population-based methods integrated within the AL framework to study the effect of different evolutionary solvers. Our results show that HyAL consistently produces high-quality solutions across the benchmark suite. It outperforms purely evolutionary approaches and scales more effectively to high-dimensional constrained problems, where evolutionary-only methods often struggle. HyAL also surpasses state-of-the-art numerical optimization algorithms on complex landscapes containing numerous local minima and saddle points.

Related papers

• A practical DIRECT-type algorithm for medium-scale black-box global optimization [0.6187780920448871]
  This paper introduces X-DTC-GL, a novel DIRECT-type algorithm that incorporates dynamic partitioning and hybridization techniques.<n>Experiments on four diverse benchmark suites demonstrate that X-DTC-GL significantly outperforms existing DIRECT-type baselines.
  arXiv  Detail & Related papers  (2026-09-09T06:48:44Z)
• A Learning-Based Cooperative Coevolution Framework for Heterogeneous Large-Scale Global Optimization [21.998622908002464]
  We propose the Learning-Based Heterogeneous Cooperative Coevolution Framework (LH-CC)<n>LH-CC adaptively selects the most suitable subproblems for each H-LSGO problem instances.<n>Our findings reveal that dynamic selection is a pivotal strategy for solving complex H-LSGO problems.
  arXiv  Detail & Related papers  (2026-03-30T00:18:05Z)
• AdaEvolve: Adaptive LLM Driven Zeroth-Order Optimization [61.535567824938205]
  We introduce AdaEvolve, a framework that reformulates LLM-driven evolution as a hierarchical adaptive optimization problem.<n>AdaEvolve consistently outperforms the open-ended baselines across 185 different open-ended optimization problems.
  arXiv  Detail & Related papers  (2026-02-23T18:45:31Z)
• Domain Knowledge Guided Bayesian Optimization For Autonomous Alignment Of Complex Scientific Instruments [0.44654729785785796]
  We propose a domain knowledge guided Bayesian Optimization approach, which leverages physical insight to simplify the search problem.<n>We demonstrate this approach's efficacy on a challenging 12-dimensional, 6-crystal Split-and-Delay optical system.<n>Our results demonstrate a generalizable paradigm: leveraging physical insight to transform high-dimensional, coupled optimization problems into simpler representations can enable rapid and robust automated tuning.
  arXiv  Detail & Related papers  (2026-02-11T09:15:20Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• Scalable Min-Max Optimization via Primal-Dual Exact Pareto Optimization [66.51747366239299]
  We propose a smooth variant of the min-max problem based on the augmented Lagrangian.<n>The proposed algorithm scales better with the number of objectives than subgradient-based strategies.
  arXiv  Detail & Related papers  (2025-03-16T11:05:51Z)
• Large Language Model-Aided Evolutionary Search for Constrained Multiobjective Optimization [15.476478159958416]
  We employ a large language model (LLM) to enhance evolutionary search for solving constrained multi-objective optimization problems. Our aim is to speed up the convergence of the evolutionary population.
  arXiv  Detail & Related papers  (2024-05-09T13:44:04Z)
• An Empirical Evaluation of Zeroth-Order Optimization Methods on AI-driven Molecule Optimization [78.36413169647408]
  We study the effectiveness of various ZO optimization methods for optimizing molecular objectives. We show the advantages of ZO sign-based gradient descent (ZO-signGD) We demonstrate the potential effectiveness of ZO optimization methods on widely used benchmark tasks from the Guacamol suite.
  arXiv  Detail & Related papers  (2022-10-27T01:58:10Z)
• Optimistic variants of single-objective bilevel optimization for evolutionary algorithms [6.788217433800101]
  A partial partial evolutionary approach has been proposed to solve the benchmark problems and have outstanding results. A new variant has also been proposed to the commonly used convergence approaches, i.e. optimistic and pessimistic. The experimental results demonstrate the algorithm converges differently to optimum solutions with the optimistic variants.
  arXiv  Detail & Related papers  (2020-08-22T23:12:07Z)
• EOS: a Parallel, Self-Adaptive, Multi-Population Evolutionary Algorithm for Constrained Global Optimization [68.8204255655161]
  EOS is a global optimization algorithm for constrained and unconstrained problems of real-valued variables. It implements a number of improvements to the well-known Differential Evolution (DE) algorithm. Results prove that EOSis capable of achieving increased performance compared to state-of-the-art single-population self-adaptive DE algorithms.
  arXiv  Detail & Related papers  (2020-07-09T10:19:22Z)
• An adaptive stochastic gradient-free approach for high-dimensional blackbox optimization [0.0]
  We propose an adaptive gradient-free (ASGF) approach for high-dimensional non-smoothing problems. We illustrate the performance of this method on benchmark global problems and learning tasks.
  arXiv  Detail & Related papers  (2020-06-18T22:47:58Z)
• IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method [64.15649345392822]
  We introduce a framework for designing primal methods under the decentralized optimization setting where local functions are smooth and strongly convex. Our approach consists of approximately solving a sequence of sub-problems induced by the accelerated augmented Lagrangian method. When coupled with accelerated gradient descent, our framework yields a novel primal algorithm whose convergence rate is optimal and matched by recently derived lower bounds.
  arXiv  Detail & Related papers  (2020-06-11T18:49:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.