Decoupling Constraint from Two Direction in Evolutionary Constrained Multi-objective Optimization

• URL: http://arxiv.org/abs/2512.23945v1
• Date: Tue, 30 Dec 2025 02:22:32 GMT
• Title: Decoupling Constraint from Two Direction in Evolutionary Constrained Multi-objective Optimization
• Authors: Ruiqing Sun, Dawei Feng, Xing Zhou, Lianghao Li, Sheng Qi, Bo Ding, Yijie Wang, Rui Wang, Huaimin Wang,
• Abstract summary: We propose a novel algorithm named Decoupling Constraint from Two Directions (DCF2D)<n>It periodically detects constraint couplings and spawns an auxiliary population for each relevant constraint with an appropriate search direction.<n>Experiments on seven challenging CMOP benchmark suites and on a collection of real-world CMOPs demonstrate that DCF2D outperforms five state-of-the-art CMOEAs.
• Score: 26.967831462095067
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Real-world Constrained Multi-objective Optimization Problems (CMOPs) often contain multiple constraints, and understanding and utilizing the coupling between these constraints is crucial for solving CMOPs. However, existing Constrained Multi-objective Evolutionary Algorithms (CMOEAs) typically ignore these couplings and treat all constraints as a single aggregate, which lacks interpretability regarding the specific geometric roles of constraints. To address this limitation, we first analyze how different constraints interact and show that the final Constrained Pareto Front (CPF) depends not only on the Pareto fronts of individual constraints but also on the boundaries of infeasible regions. This insight implies that CMOPs with different coupling types must be solved from different search directions. Accordingly, we propose a novel algorithm named Decoupling Constraint from Two Directions (DCF2D). This method periodically detects constraint couplings and spawns an auxiliary population for each relevant constraint with an appropriate search direction. Extensive experiments on seven challenging CMOP benchmark suites and on a collection of real-world CMOPs demonstrate that DCF2D outperforms five state-of-the-art CMOEAs, including existing decoupling-based methods.

Related papers

• Automatic Constraint Policy Optimization based on Continuous Constraint Interpolation Framework for Offline Reinforcement Learning [2.0719232729184145]
  offline Reinforcement Learning (RL) relies on policy constraints to shape performance.<n>Most existing methods commit to a single constraint family.<n>We propose Continuous Constraint Interpolation (CCI), a unified optimization framework.
  arXiv  Detail & Related papers  (2026-01-30T14:21:41Z)
• LLM4CMO: Large Language Model-aided Algorithm Design for Constrained Multiobjective Optimization [54.35609820607923]
  Large language models (LLMs) offer new opportunities for assisting with algorithm design.<n>We propose LLM4CMO, a novel CMOEA based on a dual-population, two-stage framework.<n>LLMs can serve as efficient co-designers in the development of complex evolutionary optimization algorithms.
  arXiv  Detail & Related papers  (2025-08-16T02:00:57Z)
• RBF++: Quantifying and Optimizing Reasoning Boundaries across Measurable and Unmeasurable Capabilities for Chain-of-Thought Reasoning [60.84707424369494]
  Chain-of-Thought (CoT) reasoning has proven effective in enhancing large language models (LLMs) on complex tasks.<n>We introduce the Reasoning Boundary Framework++ (RBF++), a framework for evaluating and optimizing measurable boundaries of CoT capability.
  arXiv  Detail & Related papers  (2025-05-19T16:25:55Z)
• Single-loop Algorithms for Stochastic Non-convex Optimization with Weakly-Convex Constraints [49.76332265680669]
  This paper examines a crucial subset of problems where both the objective and constraint functions are weakly convex.<n>Existing methods often face limitations, including slow convergence rates or reliance on double-loop designs.<n>We introduce a novel single-loop penalty-based algorithm to overcome these challenges.
  arXiv  Detail & Related papers  (2025-04-21T17:15:48Z)
• Mitigating Hallucinations in Multimodal Spatial Relations through Constraint-Aware Prompting [7.962140902232628]
  Spatial relation hallucinations pose a persistent challenge in large vision-language models (LVLMs)<n>We propose a constraint-aware prompting framework designed to reduce spatial relation hallucinations.
  arXiv  Detail & Related papers  (2025-02-12T11:32:19Z)
• A Dual Perspective of Reinforcement Learning for Imposing Policy Constraints [0.0]
  We use a generic primal-dual framework for value-based and actor-critic reinforcement learning methods.<n>The obtained dual formulations turn out to be especially useful for imposing additional constraints on the learned policy.<n>A practical algorithm is derived that supports various combinations of policy constraints that are automatically handled throughout training.
  arXiv  Detail & Related papers  (2024-04-25T09:50:57Z)
• Conflict-Averse Gradient Aggregation for Constrained Multi-Objective Reinforcement Learning [13.245000585002858]
  In many real-world applications, a reinforcement learning (RL) agent should consider multiple objectives and adhere to safety guidelines. We propose a constrained multi-objective gradient aggregation algorithm named Constrained Multi-Objective Gradient Aggregator (CoGAMO)
  arXiv  Detail & Related papers  (2024-03-01T04:57:13Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• Dealing with Structure Constraints in Evolutionary Pareto Set Learning [11.242036067940289]
  In many real-world applications, it could be desirable to have structure constraints on the entire optimal solution set. We make the first attempt to incorporate the structure constraints into the whole solution set by a single Pareto set model. With our proposed method, the decision-makers can flexibly trade off the optimality with preferred structures among all solutions.
  arXiv  Detail & Related papers  (2023-10-31T12:53:56Z)
• Algorithm for Constrained Markov Decision Process with Linear Convergence [55.41644538483948]
  An agent aims to maximize the expected accumulated discounted reward subject to multiple constraints on its costs. A new dual approach is proposed with the integration of two ingredients: entropy regularized policy and Vaidya's dual. The proposed approach is shown to converge (with linear rate) to the global optimum.
  arXiv  Detail & Related papers  (2022-06-03T16:26:38Z)
• An Instance Space Analysis of Constrained Multi-Objective Optimization Problems [1.314903445595385]
  We explore the relationship between constrained multi-objective evolutionary algorithms (CMOEAs) performance and CMOP instances characteristics using Instance Space Analysis (ISA) Detailed evaluation of problem-algorithm footprints spanning six CMOP benchmark suites and fifteen CMOEAs is presented. We conclude that two key characteristics, the isolation of non-dominate set and the correlation between constraints and objectives evolvability, have the greatest impact on algorithm performance.
  arXiv  Detail & Related papers  (2022-03-02T04:28:11Z)
• Modular Constraint Solver Cooperation via Abstract Interpretation [1.160208922584163]
  We propose a modular framework in which solvers and cooperation schemes can be seamlessly added and combined. We contribute to two new cooperation schemes: (i) interval propagators that allows abstract domains to exchange bound constraints, and (ii) delayed product which exchanges over-approximations of constraints between two abstract domains.
  arXiv  Detail & Related papers  (2020-08-04T08:52:19Z)
• Conditional gradient methods for stochastically constrained convex minimization [54.53786593679331]
  We propose two novel conditional gradient-based methods for solving structured convex optimization problems. The most important feature of our framework is that only a subset of the constraints is processed at each iteration. Our algorithms rely on variance reduction and smoothing used in conjunction with conditional gradient steps, and are accompanied by rigorous convergence guarantees.
  arXiv  Detail & Related papers  (2020-07-07T21:26:35Z)

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.