HARDY-LITTLEWOOD-POLYA INEQUALITY FOR A LINEAR DIFFERENTIAL OPERATOR AND SOME RELATED OPTIMAL PROBLEMS

In this paper a generalized version of the classical Hardy-Littlewood-Polya inequality is given.Furthermore,the Stechkin's problem for a linear differential operator is solved in L_2(R), and the optimal recovery problem for such differential operator is considered.

Gradient Recovery Based Two-Grid Finite Element Method for Parabolic Integro-Differential Optimal Control Problems

In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.

A Priori Error Analysis for NCVEM Discretization of Elliptic Optimal Control Problem

In this paper, we propose the nonconforming virtual element method (NCVEM) discretization for the pointwise control constraint optimal control problem governed by elliptic equations. Based on the NCVEM approximation of state equation and the variational discretization of control variables, we construct a virtual element discrete scheme. For the state, adjoint state and control variable, we obtain the corresponding prior estimate in H1 and L2 norms. Finally, some numerical experiments are carried out to support the theoretical results.

Virtual Element Discretization of Optimal Control Problem Governed by Brinkman Equations

In this paper, we discuss virtual element method (VEM) approximation of optimal control problem governed by Brinkman equations with control constraints. Based on the polynomial projections and variational discretization of the control variable, we build up the virtual element discrete scheme of the optimal control problem and derive the discrete first order optimality system. A priori error estimates for the state, adjoint state and control variables in L2 and H1 norm are derived. The theoretical findings are illustrated by the numerical experiments.

Solving Combinatorial Optimization Problems with Deep Neural Network:A Survey

Combinatorial Optimization Problems(COPs)are a class of optimization problems that are commonly encountered in industrial production and everyday life.Over the last few decades,traditional algorithms,such as exact algorithms,approximate algorithms,and heuristic algorithms,have been proposed to solve COPs.However,as COPs in the real world become more complex,traditional algorithms struggle to generate optimal solutions in a limited amount of time.Since Deep Neural Networks(DNNs)are not heavily dependent on expert knowledge and are adequately flexible for generalization to various COPs,several DNN-based algorithms have been proposed in the last ten years for solving COPs.Herein,we categorize these algorithms into four classes and provide a brief overview of their applications in real-world problems.

A Comparative Study of Metaheuristic Optimization Algorithms for Solving Real-World Engineering Design Problems

Real-world engineering design problems with complex objective functions under some constraints are relatively difficult problems to solve.Such design problems are widely experienced in many engineering fields,such as industry,automotive,construction,machinery,and interdisciplinary research.However,there are established optimization techniques that have shown effectiveness in addressing these types of issues.This research paper gives a comparative study of the implementation of seventeen new metaheuristic methods in order to optimize twelve distinct engineering design issues.The algorithms used in the study are listed as:transient search optimization(TSO),equilibrium optimizer(EO),grey wolf optimizer(GWO),moth-flame optimization(MFO),whale optimization algorithm(WOA),slimemould algorithm(SMA),harris hawks optimization(HHO),chimp optimization algorithm(COA),coot optimization algorithm(COOT),multi-verse optimization(MVO),arithmetic optimization algorithm(AOA),aquila optimizer(AO),sine cosine algorithm(SCA),smell agent optimization(SAO),and seagull optimization algorithm(SOA),pelican optimization algorithm(POA),and coati optimization algorithm(CA).As far as we know,there is no comparative analysis of recent and popular methods against the concrete conditions of real-world engineering problems.Hence,a remarkable research guideline is presented in the study for researchersworking in the fields of engineering and artificial intelligence,especiallywhen applying the optimization methods that have emerged recently.Future research can rely on this work for a literature search on comparisons of metaheuristic optimization methods in real-world problems under similar conditions.

Quafu-Qcover:Explore combinatorial optimization problems on cloud-based quantum computers

We introduce Quafu-Qcover,an open-source cloud-based software package developed for solving combinatorial optimization problems using quantum simulators and hardware backends.Quafu-Qcover provides a standardized and comprehensive workflow that utilizes the quantum approximate optimization algorithm(QAOA).It facilitates the automatic conversion of the original problem into a quadratic unconstrained binary optimization(QUBO)model and its corresponding Ising model,which can be subsequently transformed into a weight graph.The core of Qcover relies on a graph decomposition-based classical algorithm,which efficiently derives the optimal parameters for the shallow QAOA circuit.Quafu-Qcover incorporates a dedicated compiler capable of translating QAOA circuits into physical quantum circuits that can be executed on Quafu cloud quantum computers.Compared to a general-purpose compiler,our compiler demonstrates the ability to generate shorter circuit depths,while also exhibiting superior speed performance.Additionally,the Qcover compiler has the capability to dynamically create a library of qubits coupling substructures in real-time,utilizing the most recent calibration data from the superconducting quantum devices.This ensures that computational tasks can be assigned to connected physical qubits with the highest fidelity.The Quafu-Qcover allows us to retrieve quantum computing sampling results using a task ID at any time,enabling asynchronous processing.Moreover,it incorporates modules for results preprocessing and visualization,facilitating an intuitive display of solutions for combinatorial optimization problems.We hope that Quafu-Qcover can serve as an instructive illustration for how to explore application problems on the Quafu cloud quantum computers.

An Immune-Inspired Approach with Interval Allocation in Solving Multimodal Multi-Objective Optimization Problems with Local Pareto Sets

In practical engineering,multi-objective optimization often encounters situations where multiple Pareto sets(PS)in the decision space correspond to the same Pareto front(PF)in the objective space,known as Multi-Modal Multi-Objective Optimization Problems(MMOP).Locating multiple equivalent global PSs poses a significant challenge in real-world applications,especially considering the existence of local PSs.Effectively identifying and locating both global and local PSs is a major challenge.To tackle this issue,we introduce an immune-inspired reproduction strategy designed to produce more offspring in less crowded,promising regions and regulate the number of offspring in areas that have been thoroughly explored.This approach achieves a balanced trade-off between exploration and exploitation.Furthermore,we present an interval allocation strategy that adaptively assigns fitness levels to each antibody.This strategy ensures a broader survival margin for solutions in their initial stages and progressively amplifies the differences in individual fitness values as the population matures,thus fostering better population convergence.Additionally,we incorporate a multi-population mechanism that precisely manages each subpopulation through the interval allocation strategy,ensuring the preservation of both global and local PSs.Experimental results on 21 test problems,encompassing both global and local PSs,are compared with eight state-of-the-art multimodal multi-objective optimization algorithms.The results demonstrate the effectiveness of our proposed algorithm in simultaneously identifying global Pareto sets and locally high-quality PSs.

TIME AND NORM OPTIMAL CONTROLS:A SURVEY OF RECENT RESULTS AND OPEN PROBLEMS

We present in this paper a survey of recent results on the relation between time and norm optimality for linear systems and the infinite dimensional version of Pontryagin＇s maximum principle. In particular, we discuss optimality （or nonoptimality） of singular controls satisfying the maximum principle and smoothness of the costate in function of smoothness of the target.

A Priori and A Posteriori Error Estimates of Streamline Diffusion Finite Element Method for Optimal Control Problem Governed by Convection Dominated Diffusion Equation

In this paper,we investigate a streamline diffusion finite element approxi- mation scheme for the constrained optimal control problem governed by linear con- vection dominated diffusion equations.We prove the existence and uniqueness of the discretized scheme.Then a priori and a posteriori error estimates are derived for the state,the co-state and the control.Three numerical examples are presented to illustrate our theoretical results.

Multiple optimal solutions to a sort of nonlinear optimization problem

The optimization problem is considered in which the objective function is pseudolinear（both pseudoconvex and pseudoconcave） and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions （if the uniqueness condition is not satisfied ） are provided. Finally, an illustrative example is also given.

Solving the Optimal Control Problems of Nonlinear Duffing Oscillators By Using an Iterative Shape Functions Method

In the optimal control problem of nonlinear dynamical system,the Hamiltonian formulation is useful and powerful to solve an optimal control force.However,the resulting Euler-Lagrange equations are not easy to solve,when the performance index is complicated,because one may encounter a two-point boundary value problem of nonlinear differential algebraic equations.To be a numerical method,it is hard to exactly preserve all the specified conditions,which might deteriorate the accuracy of numerical solution.With this in mind,we develop a novel algorithm to find the solution of the optimal control problem of nonlinear Duffing oscillator,which can exactly satisfy all the required conditions for the minimality of the performance index.A new idea of shape functions method(SFM)is introduced,from which we can transform the optimal control problems to the initial value problems for the new variables,whose initial values are given arbitrarily,and meanwhile the terminal values are determined iteratively.Numerical examples confirm the high-performance of the iterative algorithms based on the SFM,which are convergence fast,and also provide very accurate solutions.The new algorithm is robust,even large noise is imposed on the input data.

Table Operation Method for Optimal Spanning Tree Problem

As far as the weight digraph is considered, based on the table instead of the weightdigraph, an optimal spanning tree method called the Table Operations Method (TOM) is proposed.And the optimality is proved and a numerical example is demonstrated.

Convergence and Superconvergence of Fully Discrete Finite Element for Time Fractional Optimal Control Problems

In this paper, we consider a fully discrete finite element approximation for time fractional optimal control problems. The state and adjoint state are approximated by triangular linear fi nite elements in space and L1 scheme in time. The control is obtained by the variational discretization technique. The main purpose of this work is to derive the convergence and superconvergence. A numerical example is presented to validate our theoretical results.

OPTIMAL CONTROL PROBLEM FOR PARABOLIC VARIATIONAL INEQUALITIES

This paper deals with the optimal control problems of systems governed by a parabolic variational inequality coupled with a semilinear parabolic differential equations. The maximum principle and some kind of approximate controllability are studied.

SEQUENTIAL QUADRATIC PROGRAMMING METHODS FOR OPTIMAL CONTROL PROBLEMS WITH STATE CONSTRAINTS

A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.

Meshfree Finite Volume Element Method for Constrained Optimal Control Problem Governed by Random Convection Diffusion Equations

In this paper,we investigate a stochastic meshfree finite volume element method for an optimal control problem governed by the convection diffusion equations with random coefficients.There are two contributions of this paper.Firstly,we establish a scheme to approximate the optimality system by using the finite volume element method in the physical space and the meshfree method in the probability space,which is competitive for high-dimensional random inputs.Secondly,the a priori error estimates are derived for the state,the co-state and the control variables.Some numerical tests are carried out to confirm the theoretical results and demonstrate the efficiency of the proposed method.

An Algorithm for the Inverse Problem of Matrix Processing: DNA Chains, Their Distance Matrices and Reconstructing

We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .

A Study of Optimum Switching Problem for Production Systems Considering Efficiency, Delivery Time and Green Evaluation

This paper aims to derive the optimal switching strategy for production system considering efficiency, delivery time and green evaluation. Nowadays more and more manufacturing and logistics systems not only pursue better work efficiency, but also focus on green energy evaluation issues. Cost reduction and shortening of delivery time are always important management issues in pursuit of efficiency and optimization of the entire production system because of global production competition. In a market situation where customer needs change in various ways, in particular, due to inadequate quality, changes in the local environment, natural disasters and so on. Therefore, prompt planning of management measures such as switching work processes and changing production methods has become an important issue. On the other hand, since the Paris Agreement came into effect, the construction of an environment-friendly production system has been required as an approach to environmental problems such as global warming. In this paper, we propose an optimum switching model of production systems considering efficiency, delivery time and green evaluation using a green evaluation index (GEC: Green Energy Coefficient). We also discuss the optimal switching strategy by numerical observation.

A Multi-Objective Optimal Evolutionary Algorithm Based on Tree-Ranking

Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time.