Constrained Optimization Problem Research Articles

An adaptive uniform search framework for constrained multi-objective optimization

This paper proposes an adaptive uniform search framework designed for constrained multi-objective optimization. The framework comprises three key components: a global uniform exploration strategy, a local greedy exploitation strategy, and a search switch mechanism. These components work together to facilitate comprehensive exploration of promising areas while maintaining a balance between global exploration and local exploitation. Specifically, the global uniform exploration strategy ensures even distribution within promising areas, preventing any oversights during exploration. The local greedy exploitation strategy divides these areas into sub-areas and employs a feasibility-led constraint handling technique to enhance efficiency in identifying optimal solutions. Additionally, the search switch dynamically adjusts the search strategy between global exploration and local exploitation. Numerical simulations on various benchmark suites and real-world problem demonstrate the strong performance of the framework in addressing constrained multi-objective optimization problems. The comparison results show that compared with eight recently proposed algorithms, the proposed framework is more robust in solving diverse constrained multi-objective optimization problems.

Edge Caching Data Distribution Strategy with Minimum Energy Consumption.

In the context of the rapid development of the Internet of Vehicles, virtual reality, automatic driving and the industrial Internet, the terminal devices in the network show explosive growth. As a result, more and more information is generated from the edge of the network, which makes the data throughput increase dramatically in the mobile communication network. As the key technology of the fifth-generation mobile communication network, mobile edge caching technology which caches popular data to the edge server deployed at the edge of the network avoids the data transmission delay of the backhaul link and the occurrence of network congestion. With the growing scale of the network, distributing hot data from cloud servers to edge servers will generate huge energy consumption. To realize the green and sustainable development of the communication industry and reduce the energy consumption of distribution of data that needs to be cached in edge servers, we make the first attempt to propose and solve the problem of edge caching data distribution with minimum energy consumption (ECDDMEC) in this paper. First, we model and formulate the problem as a constrained optimization problem and then prove its NP-hardness. Subsequently, we design a greedy algorithm with computational complexity of O(n2) to solve the problem approximately. Experimental results show that compared with the distribution strategy of each edge server directly requesting data from the cloud server, the strategy obtained by the algorithm can significantly reduce the energy consumption of data distribution.

Monarch butterfly optimization-based genetic algorithm operators for nonlinear constrained optimization and design of engineering problems

Abstract This paper aims to present a hybrid method to solve nonlinear constrained optimization problems and engineering design problems (EDPs). The hybrid method is a combination of monarch butterfly optimization (MBO) with the cross-over and mutation operators of the genetic algorithm (GA). It is called a hybrid monarch butterfly optimization with genetic algorithm operators (MBO-GAO). Combining MBO and GA operators is meant to overcome the drawbacks of both algorithms while merging their advantages. The self-adaptive cross-over and the real-valued mutation are the GA operators that are used in MBO-GAO. These operators are merged in a distinctive way within MBO processes to improve the variety of solutions in the later stages of the search process, speed up the convergence process, keep the search from getting stuck in local optima, and achieve a balance between the tendencies of exploration and exploitation. In addition, the greedy approach is presented in both the migration operator and the butterfly adjusting operator, which can only accept offspring of the monarch butterfly groups who are fitter than their parents. Finally, popular test problems, including a set of 19 benchmark problems, are used to test the proposed hybrid algorithm, MBO-GAO. The findings obtained provide evidence supporting the higher performance of MBO-GAO compared with other search techniques. Additionally, the performance of the MBO-GAO is examined for several EDPs. The computational results show that the MBO-GAO method exhibits competitiveness and superiority over other optimization algorithms employed for the resolution of EDPs.

Distributed gradient-free and projection-free algorithm for stochastic constrained optimization

Distributed stochastic zeroth-order optimization (DSZO), in which the objective function is allocated over multiple agents and the derivative of cost functions is unavailable, arises frequently in large-scale machine learning and reinforcement learning. This paper introduces a distributed stochastic algorithm for DSZO in a projection-free and gradient-free manner via the Frank-Wolfe framework and the stochastic zeroth-order oracle (SZO). Such a scheme is particularly useful in large-scale constrained optimization problems where calculating gradients or projection operators is impractical, costly, or when the objective function is not differentiable everywhere. Specifically, the proposed algorithm, enhanced by recursive momentum and gradient tracking techniques, guarantees convergence with just a single batch per iteration. This significant improvement over existing algorithms substantially lowers the computational complexity. Under mild conditions, we prove that the complexity bounds on SZO of the proposed algorithm are O(n/ϵ2)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathcal{O}(n/\\epsilon ^{2})$\\end{document} and O(n(21ϵ))\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$\\mathcal{O}(n(2^{\\frac{1}{\\epsilon}}))$\\end{document} for convex and nonconvex cases, respectively. The efficacy of the algorithm is verified on black-box binary classification problems against several competing alternatives.

A new adaptive Kriging-based optimization (AKBO) framework for constrained optimization problems: A case study on shared autonomous electric vehicle system design

Adaptive Kriging-based optimization (AKBO) efficiently performs optimization by employing adaptive sampling methods that sequentially update Kriging model. To solve constrained optimization problems, existing adaptive sampling methods add samples based on probability of feasibility (PoF) representing the probability that all constraints are satisfied. However, these methods have the limitation that samples are added inefficiently when the PoF is inaccurate. Therefore, this study proposes a new AKBO framework that is robust to instability of PoF in adaptive sampling. To this end, a near constraint boundary region that is expected to be close to the constraint boundary is defined based on a probability measure. Then, a near constraint boundary search (NCBS) algorithm, which explores the sample point that minimizes the objective function within the near constraint boundary region, is developed for global search, whereas a near optimum search (NOS) algorithm, which searches for better solutions that may exist near the current optimum candidate, is developed for local search. To alleviate the distortions of the Kriging model that may occur due to the highly nonlinear response, a truncated constraint function (TCF) method that limits the extremely violated constraint values used in the design of experiment (DoE) of the Kriging model is also proposed. This study verifies the performance of the proposed AKBO framework through the shared autonomous electric vehicle (SAEV) system design optimization problem. Comparison of optimum designs derived from various optimization methods shows that the proposed AKBO framework derives the feasible global optimum with high accuracy and efficiency.

Local perturbation-based black-box federated learning attack for time series classification

The widespread adoption of intelligent machines and sensors has generated vast amounts of time series data, leading to the increasing use of neural networks in time series classification. Federated learning has emerged as a promising machine learning paradigm that reduces the risk of user privacy leakage. However, federated learning is vulnerable to backdoor attacks, which pose significant security threats. Furthermore, existing unrealistic white-box methods for attacking time series result in insufficient adaptation and inferior stealthiness. To overcome these limitations, this paper proposes a gradient-free black-box method called local perturbation-based backdoor Federated Learning Attack for Time Series classification (FLATS). The attack is formulated as a constrained optimization problem and is solved using a differential evolution algorithm, without requiring any knowledge of the internal architecture of the target model. In addition, the proposed method considers the time series shapelet interval as a local perturbation range and adopts a soft target poisoning approach to minimize the difference between the attacker model and the benign model. Experimental results demonstrate that our proposed method can effectively attack federated learning time series classification models with potential security issues while generating imperceptible poisoned samples that can evade various defence methods.

A novel multi-population evolutionary algorithm based on hybrid collaboration for constrained multi-objective optimization

Multi-population-based methods are widely employed for solving constrained multiobjective optimization problems (CMOPs). The population collaboration strategy is a critical part of multi-population algorithms, and different collaboration strategies perform well on different complex CMOPs. However, these single-population collaboration strategies are still challenging to adapt to various CMOPs with different characteristics. To address this issue, we propose a novel tri-population hybrid collaboration evolutionary algorithm called TP-HCEA, which includes a constraint-relaxed population (denoted as mainpop), a constraint-ignored auxiliary population (denoted as auxpop1), and an auxiliary population (denoted as auxpop2) for the original CMOP, to search optimal solutions in the feasible region. Specifically, due to the different complementarities of the two auxiliary populations, mainpop collaborates with auxpop1 and auxpop2 in a dynamic choice between strong and weak cooperation. The effectiveness of TP-HCEA is validated through comparative analysis with seven state-of-the-art algorithms in four CMOP benchmark suites and nine real-world problems.

A pareto fronts relationship identification-based two-stage constrained evolutionary algorithm

Striking a balance between diverse constraints and conflicting objectives is one of the most crucial issues in solving constrained multi-objective optimization problems (CMOPs). However, it remains challenging to existing methods, due to the reduced search space caused by the constraints. For this issue, this paper proposes a Pareto fronts relationship identification-based two-stage constrained evolutionary algorithm called RITEA, which balances objective optimization and constraint satisfaction by identifying and utilizing the relationship between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF). Specifically, the evolutionary process is divided into two collaborative stages: training stage and reinforcement stage. In the training stage, a relationship identification method is developed to estimate the relationship between UPF and CPF, which guides the population search direction. In the reinforcement stage, the corresponding evolutionary strategies are designed based on the identified relationship to enhance the accurate search on the CPF. Furthermore, a dynamic preference fitness function (termed DPF) is designed to adaptively maintain the balance of search preference between convergence and diversity. Compared to seven state-of-the-art algorithms on 36 benchmark CMOPs in three popular test suites, RITEA obtains 77.8% of the best IGD values and 66.7% of the best HV values. The experimental results show that RITEA exhibits highly competitively when dealing with CMOPs.

An Improved Aquila Optimizer with Local Escaping Operator and Its Application in UAV Path Planning

Background: With the development of intelligent technology, Unmanned aerial vehicles (UAVs) are widely used in military and civilian fields. Path planning is the most important part of UAV navigation system. Its purpose is to find a smooth and feasible path from the start to the end. Objective: In order to obtain a better flight path, this paper presents an improved Aquila optimizer combing the opposition-based learning and the local escaping operator, named LEOAO, to deal with the UAV path planning problem in three-dimensional environments. Methods: UAV path planning is modelled as a constrained optimization problem in which the cost function consists of one objective: path length and four constraints: safe distance, flight height, turning angle and climbing/diving angle. In this paper, the LEOAO is introduced to find the optimal path by minimizing the cost function, and B-Spline is invited to represent a smooth path. The local escaping operator is used to enhance the search ability of the algorithm. Results: To test the performance of LEOAO, two scenarios are applied based on basic terrain function. Experiments show that the proposed LEOAO outperforms other algorithms such as the grey wolf optimizer, whale optimization algorithm, including the original Aquila optimizer. Conclusion: The proposed algorithm combines the opposition-based learning and local escaping operator. The opposition-based learning algorithm has the ability to accelerate convergence. And the introduction of LEO effectively balances the exploration and exploitation abilities of the algorithm and improves the quality of the population. Finally, the improved Aquila optimizer obtains a better path.

A novel variational approach for multiphoton microscopy image restoration: from PSF estimation to 3D deconvolution

In multi-photon microscopy (MPM), a recent in-vivo fluorescence microscopy system, the task of image restoration can be decomposed into two interlinked inverse problems: firstly, the characterization of the point spread function (PSF) and subsequently, the deconvolution (i.e. deblurring) to remove the PSF effect, and reduce noise. The acquired MPM image quality is critically affected by PSF blurring and intense noise. The PSF in MPM is highly spread in 3D and is not well characterized, presenting high variability with respect to the observed objects. This makes the restoration of MPM images challenging. Common PSF estimation methods in fluorescence microscopy, including MPM, involve capturing images of sub-resolution beads, followed by quantifying the resulting ellipsoidal 3D spot. In this work, we revisit this approach, coping with its inherent limitations in terms of accuracy and practicality. We estimate the PSF from the observation of relatively large beads (approximately 1 μm in diameter). This goes through the formulation and resolution of an original non-convex minimization problem, for which we propose a proximal alternating method along with convergence guarantees. Following the PSF estimation step, we then introduce an innovative strategy to deal with the high level multiplicative noise degrading the acquisitions. We rely on a heteroscedastic noise model for which we estimate the parameters. We then solve a constrained optimization problem to restore the image, accounting for the estimated PSF and noise, while allowing a minimal hyper-parameter tuning. Theoretical guarantees are given for the restoration algorithm. These algorithmic contributions lead to an end-to-end pipeline for 3D image restoration in MPM, that we share as a publicly available Python software. We demonstrate its effectiveness through several experiments on both simulated and real data.

AN-SPS: adaptive sample size nonmonotone line search spectral projected subgradient method for convex constrained optimization problems

We consider convex optimization problems with a possibly nonsmooth objective function in the form of a mathematical expectation. The proposed framework (AN-SPS) employs Sample Average Approximations (SAA) to approximate the objective function, which is either unavailable or too costly to compute. The sample size is chosen in an adaptive manner, which eventually pushes the SAA error to zero almost surely (a.s.). The search direction is based on a scaled subgradient and a spectral coefficient, both related to the SAA function. The step size is obtained via a nonmonotone line search over a predefined interval, which yields a theoretically sound and practically efficient algorithm. The method retains feasibility by projecting the resulting points onto a feasible set. The a.s. convergence of AN-SPS method is proved without the assumption of a bounded feasible set or bounded iterates. Preliminary numerical results on Hinge loss problems reveal the advantages of the proposed adaptive scheme. In addition, a study of different nonmonotone line search strategies in combination with different spectral coefficients within AN-SPS framework is also conducted, yielding some hints for future work.

A non-overlapping optimization-based domain decomposition approach to component-based model reduction of incompressible flows

We present a component-based model order reduction procedure to efficiently and accurately solve parameterized incompressible flows governed by the Navier-Stokes equations. Our approach leverages a non-overlapping optimization-based domain decomposition technique to determine the control variable that minimizes jumps across the interfaces between sub-domains. To solve the resulting constrained optimization problem, we propose both Gauss-Newton and sequential quadratic programming methods, which effectively transform the constrained problem into an unconstrained formulation. Furthermore, we integrate model order reduction techniques into the optimization framework, to speed up computations. In particular, we incorporate localized training and adaptive enrichment to reduce the burden associated with the training of the local reduced-order models. Numerical results are presented to demonstrate the validity and effectiveness of the overall methodology.

SOLVING FUZZY NONLINEAR PROGRAMMING PROBLEMS WITH EXTERIOR PENALTY FUZZY VALUED FUNCTIONS

In this article, we explore the exterior penalty fuzzy valued function method for Fuzzy Nonlinear Programming Problems (FNLPP). We present methods of penalty fuzzy valued function for solving constrained optimization problems by converting to unconstrained optimization problems. Triangular fuzzy numbers are used to represent the problem’s decision variables and coefficients. Using a new fuzzy arithmetic and fuzzy ranking method on the parametric form of triangular fuzzy numbers, the optimal solution of the FNLPP is found by applying the exterior penalty fuzzy valued function method without changing to its equivalent crisp form. We present a numerical example of the suggested method and compare the results to those produced by existing methods

An extended discontinuous Galerkin shock tracking method

AbstractIn this paper, we introduce a novel high‐order shock tracking method and provide a proof of concept. Our method leverages concepts from implicit shock tracking and extended discontinuous Galerkin methods, primarily designed for solving partial differential equations featuring discontinuities. To address this challenge, we solve a constrained optimization problem aiming at accurately fitting the zero iso‐contour of a level set function to the discontinuities. Additionally, we discuss various robustness measures inspired by both numerical experiments and existing literature. Finally, we showcase the capabilities of our method through a series of two‐dimensional problems, progressively increasing in complexity.

A two-stage bidirectional coevolution algorithm with reverse search for constrained multiobjective optimization

Constrained multiobjective optimization problems (CMOPs) are widespread in reality. The presence of constraints complicates the feasible region of the original problem and increases the difficulty of problem solving. There are not only feasible regions, but also large areas of infeasible regions in the objective space of CMOPs. Inspired by this, this paper proposes a bidirectional coevolution method with reverse search (BCRS) combined with a two-stage approach. In the first stage of evolution, constraints are ignored and the population is pushed toward promising regions. In the second stage, evolution is divided into two parts, i.e., the main population evolves toward the constrained Pareto front (CPF) within the feasible region, while the reverse population approaches the CPF from the infeasible region. Then a solution exchange strategy similar to weak cooperation is used between the two populations. The experimental results on benchmark functions and real-world problems show that the proposed algorithm exhibits superior or at least competitive performance compared to other state-of-the-art algorithms. It demonstrates BCRS is an effective algorithm for addressing CMOPs.Graphical

A collective neurodynamic approach to distributed resource allocation with event-triggered communication

To solve a distributed optimal resource allocation problem, a collective neurodynamic approach based on recurrent neural networks (RNNs) is proposed in this paper. Multiple RNNs cooperatively solve a global constrained optimization problem in which the objective function is a total of local non-smooth convex functions and is subject to local convex sets and a global equality constraint. Different from the projection dynamics to deal with local convex sets in the existing work, an internal dynamics with projection output is designed in the algorithm to relax the Slater’s condition satisfied by the optimal solution. To overcome continuous-time communication in a group of RNNs, an aperiodic communication scheme, called the event-triggered scheme, is presented to alleviate communication burden. It is analyzed that the convergence of the designed collective neurodynamic approach based on the event-triggered communication does not rely on global information. Furthermore, it is proved the freeness of the Zeno behavior in the event-triggered scheme. Two examples are presented to illustrate the obtained results

Estimation of shape memory alloy actuator dynamics to design reduced‐order position controller with input saturation

AbstractThis study focuses on the precise model estimation for a position control problem actuated by a shape memory alloy (SMA) wire. Because the hysteresis characteristic of SMA introduces complexities in system modelling and adds degrees of freedom, a model with reduced order is implemented for controller design. This model is online updated by calculating a complementary term from the measured data to compensate for the SMA actuator dynamics and other parametric uncertainties. The position controller, derived from the formulated reduced‐order model, adapts itself to real conditions and is cost‐effective due to the use of only displacement sensor. The saturation of the control input is modelled within the structure of a constrained optimization problem solved by Karush–Kuhn–Tucker theorem. The boundedness of mean and covariance of tracking error and its derivative is demonstrated by stochastic analysis. The experimental results conducted on a platform incorporating a SMA wire show the efficiency of the proposed system in precisely controlling the position by admissible voltage range. The comparative results with a sliding mode controller indicate higher accuracy for the proposed controller to reduce the effect of uncertainties.

Intelligent Reduced-Dimensional Scheme of Model Predictive Control for Aero-Engines

Model Predictive Control (MPC) has many advantages in controlling an aero-engine, such as handling actuator constraints, but the computational burden greatly obstructs its application. The current multiplex MPC can reduce computational complexity, but it will significantly decrease the control performance. To guarantee real-time performance and good control performance simultaneously, an intelligent reduced-dimensional scheme of MPC is proposed. The scheme includes a control variable selection algorithm and a control sequence coordination strategy. A constrained optimization problem with low computational complexity is first constructed by using only one control variable to define a reduced-dimensional control sequence. Therein, the control variable selection algorithm provides an intelligent mode to determine the control variable that has the best control effect at the current sampling instant. Furthermore, a coordination strategy is adopted in the reduced-dimensional control sequence to consider the interaction of control variables at different predicting instants. Finally, an intelligent reduced-dimensional MPC controller is designed and implemented on an aero-engine. Simulation results demonstrate the effectiveness of the intelligent reduced-dimensional scheme. Compared with the multiplex MPC, the intelligent reduced-dimensional MPC controller enhances the control quality significantly by 34.06%; compared with the standard MPC, the average time consumption is decreased by 64.72%.

On-line minimum loss control strategy of IPMSM in torque-controlled application

This study proposes an on-line minimum loss (ML) control strategy that considers the iron and copper losses of an interior permanent magnet synchronous motor in torque-controlled applications. The proposed ML control strategy utilizes a constrained optimization problem to satisfy torque reference tracking and loss minimization. An equivalent iron loss resistance circuit is adopted for the loss minimization. To solve the optimization problem, the Lagrange multiplier method is applied through a numerical analysis algorithm. The resulting solution provides the optimal current reference for every sampling instant. The Lagrange multiplier method needs parameters such as magnetic flux linkages, dynamic inductances, and iron loss resistance. Fundamental magnetic flux linkages are estimated using a flux observer, and the dynamic inductances are estimated with high-frequency voltage signal injection. The proposed iron loss resistance estimator estimates the equivalent iron resistance without any preliminary experiments. DC input power is measured using a current sensor for the accurate on-line estimation of iron loss resistance. To analyze the effectiveness of ML control compared with conventional maximum torque per ampere control, finite element analysis is used. The feasibility of the proposed ML control strategy is verified through simulation and experiments.

A Novel Gaussian Process Surrogate Model with Expected Prediction Error for Optimization under Constraints

Optimization, particularly constrained optimization problems (COPs), is fundamental in engineering, influencing various sectors with its critical role in enhancing design efficiency, reducing experimental costs, and shortening testing cycles. This study explores the challenges inherent in COPs, with a focus on developing efficient solution methodologies under stringent constraints. Surrogate models, especially Gaussian Process Regression (GPR), are pivotal in our approach, enabling the approximation of complex systems with reduced computational demand. We evaluate the efficacy of the Efficient Global Optimization (EGO) algorithm, which synergizes GPR with the Expected Improvement (EI) function, and further extend this framework to Constrained Expected Improvement (CEI) and our novel methodology Constrained Expected Prediction Error (CEPE). We demonstrate the effectiveness of these methodologies by numerical benchmark simulations and the real-world application of optimizing a Three-Bar Truss Design. In essence, the innovative CEPE approach promises a potent balance between solution accuracy and computational prowess, offering significant potential in the broader engineering field.