Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory,offering critical guidance for experimental implementations.In t...Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory,offering critical guidance for experimental implementations.In this paper,we embark on an in-depth exploration of the use of a quantum state prepared by the convex combination of given qubit states to optimally approximate the l_(1)-norm of coherence of the target quantum state,striving to make the prepared state and the target state as similar as possible.Here,we present the analytical solution for the optimal distance for any N given quantum states.We find that the optimal approximation problem for any N>4 quantum states can be transformed into an optimal approximation problem for no more than four quantum states,which not only significantly streamlines the problem but also proves advantageous for laboratories in terms of material conservation.Ultimately,a one-to-one comparison between the analytical and numerical solutions verifies the effectiveness of our approach.展开更多
This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encounter...This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.展开更多
An approximation for the one-way wave operator takes the form of separated space and wave-number variables and makes it possible to use the FFT, which results in a great improvement in the computational efficiency. Fr...An approximation for the one-way wave operator takes the form of separated space and wave-number variables and makes it possible to use the FFT, which results in a great improvement in the computational efficiency. From the function approximation perspective, the OSA method shares the same separable approximation format to the one-way wave operator as other separable approximation methods but it is the only global function approximation among these methods. This leads to a difference in the phase error curve, impulse response, and migration result from other separable approximation methods. The difference is that the OSA method has higher accuracy, and the sensitivity to the velocity variation declines with increasing order.展开更多
In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the ...In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the least residual problem of the above generalized inverse eigenvalue problem is studied by using the canonical correlation decomposition（CCD）.The solutions to these problems are derived.Some numerical examples are given to illustrate the main results.展开更多
An accurate and wide-angle one-way propagator for wavefield extrapolation is an important topic for research on wave-equation prestack depth migration in the presence of large and rapid velocity variations. Based on t...An accurate and wide-angle one-way propagator for wavefield extrapolation is an important topic for research on wave-equation prestack depth migration in the presence of large and rapid velocity variations. Based on the optimal separable approximation presented in this paper, the mixed domain algorithm with forward and inverse Fourier transforms is used to construct the 3D one-way wavefield extrapolation operator. This operator separates variables in the wavenumber and spatial domains. The phase shift operation is implemented in the wavenumber domain while the time delay for lateral velocity variation is corrected in the spatial domain. The impulse responses of the one-way wave operator show that the numeric computation is consistent with the theoretical value for each velocity, revealing that the operator constructed with the optimal separable approximation can be applied to lateral velocity variations for the case of small steps. Imaging results of the SEG/EAGE model and field data indicate that the new method can be used to image complex structure.展开更多
A method of approaching to the infinite dimensional linear operators by the finite dimensional operators is discussed. It is shown that,for every infinite dimensional operator A and every natural number n, there exist...A method of approaching to the infinite dimensional linear operators by the finite dimensional operators is discussed. It is shown that,for every infinite dimensional operator A and every natural number n, there exists an n dimensional optimal approximation to A. The norm error is found and the necessary and sufficient condition for such n dimensional optimal approximations to be unique is obtained.展开更多
The offset-domain prestack depth migration with optimal separable approximation, based on the double square root equation, is used to image complex media with large and rapid velocity variations. The method downward c...The offset-domain prestack depth migration with optimal separable approximation, based on the double square root equation, is used to image complex media with large and rapid velocity variations. The method downward continues the source and the receiver wavefields simultaneously. The mixed domain algorithm with forward Fourier and inverse Fourier transform is used to construct the double square root equation wavefield extrapolation operator. This operator separates variables in the wave number domain and variables in the space domain. The phase operation is implemented in the wave number domain, whereas the time delay for lateral velocity variation is corrected in the space domain. The migration algorithm is efficient since the seismic data are not computed shot by shot. The data set test of the Marmousi model indicates that the offset-domain migration provides a satisfied seismic migration section on which complex geologic structures are imaged in media with large and rapid lateral velocity variations.展开更多
In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the ta...In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the target structure matrix is constructed by using the complex decomposition of the quaternion matrix, to obtain the necessary and sufficient conditions for the existence of the cyclic solution of the equation and the expression of the general solution. Secondly, the Stein equation is converted into the Sylvester equation by adding the necessary parameters, and the condition for the existence of a cyclic solution and the expression of the equation’s solution are then obtained by using the real decomposition of the quaternion matrix and the Kronecker product of the matrix. At the same time, under the condition that the solution set is non-empty, the optimal approximation solution to the given quaternion circulant matrix is obtained by using the property of Frobenius norm property. Numerical examples are given to verify the correctness of the theoretical results and the feasibility of the proposed method. .展开更多
In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solv...In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.展开更多
A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-co...A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.展开更多
Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a ...Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.展开更多
The Quantum Approximate Optimization Algorithm(QAOA)is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.It consists of interleaved unitary transformations induced by tw...The Quantum Approximate Optimization Algorithm(QAOA)is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.It consists of interleaved unitary transformations induced by two operators labelled the mixing and problem Hamiltonians.To fit this framework,one needs to transform the original problem into a suitable form and embed it into these two Hamiltonians.In this paper,for the well-known NP-hard Traveling Salesman Problem(TSP),we encode its constraints into the mixing Hamiltonian rather than the conventional approach of adding penalty terms to the problem Hamiltonian.Moreover,we map edges(routes)connecting each pair of cities to qubits,which decreases the search space significantly in comparison to other approaches.As a result,our method can achieve a higher probability for the shortest round-trip route with only half the number of qubits consumed compared to IBM Q’s approach.We argue the formalization approach presented in this paper would lead to a generalized framework for finding,in the context of QAOA,high-quality approximate solutions to NP optimization problems.展开更多
In the interception engagement,if the target movement information is not accurate enough for the mid-course guidance of intercepting missiles,the interception mission may fail as a result of large handover errors.This...In the interception engagement,if the target movement information is not accurate enough for the mid-course guidance of intercepting missiles,the interception mission may fail as a result of large handover errors.This paper proposes a novel cooperative mid-course guidance scheme for multiple missiles to intercept a target under the condition of large detection errors.Under this scheme,the launch and interception moments are staggered for different missiles.The earlier launched missiles can obtain a relatively accurate detection to the target during their terminal guidance,based on which the latter missiles are permitted to eliminate the handover error in the mid-course guidance.A significant merit of this scheme is that the available resources are fully exploited and less missiles are needed to achieve the interception mission.To this end,first,the design of cooperative handover parameters is formulated as an optimization problem.Then,an algorithm based on Monte Carlo sampling and stochastic approximation is proposed to solve this optimization problem,and the convergence of the algorithm is proved as well.Finally,simulation experiments are carried out to validate the effectiveness of the proposed cooperative scheme and algorithm.展开更多
Control systems designed by the principle of matching gives rise to problems of evaluating the peak output. This paper proposes a practical method for computing the peak output of linear time-invariant and non-anticip...Control systems designed by the principle of matching gives rise to problems of evaluating the peak output. This paper proposes a practical method for computing the peak output of linear time-invariant and non-anticipative systems for a class of possible sets that are characterized with many bounding conditions on the two- and/or the infinity-norms of the inputs and their derivatives. The original infinite-dimensional convex optimization problem is approximated as a large-scale convex programme defined in a Euclidean space, which are associated with sparse matrices and thus can be solved efficiently in practice. The numerical results show that the method performs satisfactorily, and that using a possible set with many bounding conditions can help to reduce the design conservatism and thereby yield a better match.展开更多
This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective function...This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.展开更多
In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of co...In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.展开更多
The matrix equations (AX, XBH)=(C, DH) have been widely used in structural design, parameter identification, linear optimal control, and so on. But few researches studied the reflexive solutions. A new approach for th...The matrix equations (AX, XBH)=(C, DH) have been widely used in structural design, parameter identification, linear optimal control, and so on. But few researches studied the reflexive solutions. A new approach for the reflexive solutions to the matrix equations was proposed. By applying the canonical correlation decomposition (CCD) of matrix pairs, the necessary and sufficient conditions for the existence and the general expression for the reflexive solutions of the matrix equations (AX, XBH)=(C, DH) were established. In addition, by using the methods of space decomposition, the expression of the optimal approximation solution to a given matrix was derived.展开更多
The problem of correcting simultaneously mass and stiffness matrices of finite element model of undamped structural systems using vibration tests is considered in this paper.The desired matrix properties,including sat...The problem of correcting simultaneously mass and stiffness matrices of finite element model of undamped structural systems using vibration tests is considered in this paper.The desired matrix properties,including satisfaction of the characteristic equation,symmetry,positive semidefiniteness and sparsity,are imposed as side constraints to form the optimal matrix pencil approximation problem.Using partial Lagrangian multipliers,we transform the nonlinearly constrained optimization problem into an equivalent matrix linear variational inequality,develop a proximal point-like method for solving the matrix linear variational inequality,and analyze its global convergence.Numerical results are included to illustrate the performance and application of the proposed method.展开更多
A novel numerical method is presented to update mass and stiffness matrices simultaneously with measured vibration data by means of the combined acceleration and displacement output feedback.By the method,the required...A novel numerical method is presented to update mass and stiffness matrices simultaneously with measured vibration data by means of the combined acceleration and displacement output feedback.By the method,the required displacement and acceleration output feedback gain matrices are determined,and thus the optimal approximation mass matrix and stiffness matrix which satisfy the required orthogonality relation and eigenvalue equation are found.The proposed method is computationally efficient and the updated mass and stiffness matrices are also symmetric and have the compact expressions.The numerical example shows that the proposed method is reliable and attractive.展开更多
The least-square solutions of inverse problem for anti-symmetric and skew-symmetric matrices are studied. In addition, the problem of using anti-symmetric and skew-symmetric matrices to construct the optimal approxima...The least-square solutions of inverse problem for anti-symmetric and skew-symmetric matrices are studied. In addition, the problem of using anti-symmetric and skew-symmetric matrices to construct the optimal approximation to a given matrix is discussed, the necessary and sufficient conditions for the problem are derived, and the expression of the solution is provided. A numerical example is given to show the effectiveness of the proposed method.展开更多
基金supported by the Fundamental Research Projects of Shanxi Province(Grant No.202203021222225)the National Natural Science Foundation of China(Grant Nos.12175029,12011530014,and 11775040)the Key Research and Development Project of Liaoning Province(Grant No.2020JH2/10500003).
文摘Determining the minimal distance between the target state and the convex combination of given states is a fundamental problem in quantum resource theory,offering critical guidance for experimental implementations.In this paper,we embark on an in-depth exploration of the use of a quantum state prepared by the convex combination of given qubit states to optimally approximate the l_(1)-norm of coherence of the target quantum state,striving to make the prepared state and the target state as similar as possible.Here,we present the analytical solution for the optimal distance for any N given quantum states.We find that the optimal approximation problem for any N>4 quantum states can be transformed into an optimal approximation problem for no more than four quantum states,which not only significantly streamlines the problem but also proves advantageous for laboratories in terms of material conservation.Ultimately,a one-to-one comparison between the analytical and numerical solutions verifies the effectiveness of our approach.
基金financially supported by the National Key R&D Program (2022YFB4201302)Guang Dong Basic and Applied Basic Research Foundation (2022A1515240057)the Huaneng Technology Funds (HNKJ20-H88).
文摘This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.
基金sponsored by the National Natural Science Foundation of China (Nos. 40774069 and 40974074)the State Key Program of National Natural Science of China (No. 40830424)the National 973program (No. 007209603)
文摘An approximation for the one-way wave operator takes the form of separated space and wave-number variables and makes it possible to use the FFT, which results in a great improvement in the computational efficiency. From the function approximation perspective, the OSA method shares the same separable approximation format to the one-way wave operator as other separable approximation methods but it is the only global function approximation among these methods. This leads to a difference in the phase error curve, impulse response, and migration result from other separable approximation methods. The difference is that the OSA method has higher accuracy, and the sensitivity to the velocity variation declines with increasing order.
基金Supported by the Key Discipline Construction Project of Tianshui Normal University
文摘In this paper,the generalized inverse eigenvalue problem for the（P,Q）-conjugate matrices and the associated approximation problem are discussed by using generalized singular value decomposition（GSVD）.Moreover,the least residual problem of the above generalized inverse eigenvalue problem is studied by using the canonical correlation decomposition（CCD）.The solutions to these problems are derived.Some numerical examples are given to illustrate the main results.
基金This research is sponsored by China National Natural Science Foundation （N0. 40474047）.
文摘An accurate and wide-angle one-way propagator for wavefield extrapolation is an important topic for research on wave-equation prestack depth migration in the presence of large and rapid velocity variations. Based on the optimal separable approximation presented in this paper, the mixed domain algorithm with forward and inverse Fourier transforms is used to construct the 3D one-way wavefield extrapolation operator. This operator separates variables in the wavenumber and spatial domains. The phase shift operation is implemented in the wavenumber domain while the time delay for lateral velocity variation is corrected in the spatial domain. The impulse responses of the one-way wave operator show that the numeric computation is consistent with the theoretical value for each velocity, revealing that the operator constructed with the optimal separable approximation can be applied to lateral velocity variations for the case of small steps. Imaging results of the SEG/EAGE model and field data indicate that the new method can be used to image complex structure.
文摘A method of approaching to the infinite dimensional linear operators by the finite dimensional operators is discussed. It is shown that,for every infinite dimensional operator A and every natural number n, there exists an n dimensional optimal approximation to A. The norm error is found and the necessary and sufficient condition for such n dimensional optimal approximations to be unique is obtained.
基金This paper is supported by the National Natural Science Foundation of China (No. 40474047)State Key Laboratory of Geological Processes and Mineral Resources (No. GPMR200654)the Focused Subject Program of Beijing (No. XK104910598).
文摘The offset-domain prestack depth migration with optimal separable approximation, based on the double square root equation, is used to image complex media with large and rapid velocity variations. The method downward continues the source and the receiver wavefields simultaneously. The mixed domain algorithm with forward Fourier and inverse Fourier transform is used to construct the double square root equation wavefield extrapolation operator. This operator separates variables in the wave number domain and variables in the space domain. The phase operation is implemented in the wave number domain, whereas the time delay for lateral velocity variation is corrected in the space domain. The migration algorithm is efficient since the seismic data are not computed shot by shot. The data set test of the Marmousi model indicates that the offset-domain migration provides a satisfied seismic migration section on which complex geologic structures are imaged in media with large and rapid lateral velocity variations.
文摘In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the target structure matrix is constructed by using the complex decomposition of the quaternion matrix, to obtain the necessary and sufficient conditions for the existence of the cyclic solution of the equation and the expression of the general solution. Secondly, the Stein equation is converted into the Sylvester equation by adding the necessary parameters, and the condition for the existence of a cyclic solution and the expression of the equation’s solution are then obtained by using the real decomposition of the quaternion matrix and the Kronecker product of the matrix. At the same time, under the condition that the solution set is non-empty, the optimal approximation solution to the given quaternion circulant matrix is obtained by using the property of Frobenius norm property. Numerical examples are given to verify the correctness of the theoretical results and the feasibility of the proposed method. .
基金supported by National Natural Science Foundation of China (10571047)and by Scientific Research Fund of Hunan Provincial Education Department of China Grant(06C235)+1 种基金by Central South University of Forestry and Technology (06Y017)by Specialized Research Fund for the Doctoral Program of Higher Education (20060532014)
文摘In this article, the generalized reflexive solution of matrix equations （AX = B, XC = D） is considered. With special properties of generalized reflexive matrices, the necessary and sufficient conditions for the solvability and the general expression of the solution are obtained. Moreover, the related optimal approximation problem to a given matrix over the solution set is solved.
基金Projects(51435009,51575212,61573249,61371200)supported by the National Natural Science Foundation of ChinaProjects(2015T80798,2014M552040,2014M561250,2015M571328)supported by Postdoctoral Science Foundation of ChinaProject(L2015372)supported by Liaoning Province Education Administration,China
文摘A Lagrangian relaxation(LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop(FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization of LR problems in traditional LR approaches, the machine capacity relaxation is optimized asymptotically, while the precedence relaxation is optimized approximately due to the NP-hard nature of its LR problem. Because the standard subgradient algorithm(SSA) cannot solve the Lagrangian dual(LD) problem within the partial optimization of LR problem, an effective deflected-conditional approximate subgradient level algorithm(DCASLA) was developed, named as Lagrangian relaxation level approach. The efficiency of the DCASLA is enhanced by a deflected-conditional epsilon-subgradient to weaken the possible zigzagging phenomena. Computational results and comparisons show that the proposed methods improve significantly the efficiency of the LR approach and the DCASLA adopting capacity relaxation strategy performs best among eight methods in terms of solution quality and running time.
基金supported by Macao FDCT(098/2012/A3)Research Grant of the University of Macao(UL017/08-Y4/MAT/QT01/FST)+1 种基金National Natural Science Funds for Young Scholars(10901166)Sun Yat-sen University Operating Costs of Basic ResearchProjects to Cultivate Young Teachers(11lgpy99)
文摘Appealing to the Clifford analysis and matching pursuits, we study the adaptive decompositions of functions of several variables of finite energy under the dictionaries consisting of shifted Cauchy kernels. This is a realization of matching pursuits among shifted Cauchy kernels in higher-dimensional spaces. It offers a method to process signals in arbitrary dimensions.
基金This work is supported by the Natural Science Foundation,China(Grant No.61802002)Natural Science Foundation of Anhui Province,China(Grant No.1708085MF162).
文摘The Quantum Approximate Optimization Algorithm(QAOA)is an algorithmic framework for finding approximate solutions to combinatorial optimization problems.It consists of interleaved unitary transformations induced by two operators labelled the mixing and problem Hamiltonians.To fit this framework,one needs to transform the original problem into a suitable form and embed it into these two Hamiltonians.In this paper,for the well-known NP-hard Traveling Salesman Problem(TSP),we encode its constraints into the mixing Hamiltonian rather than the conventional approach of adding penalty terms to the problem Hamiltonian.Moreover,we map edges(routes)connecting each pair of cities to qubits,which decreases the search space significantly in comparison to other approaches.As a result,our method can achieve a higher probability for the shortest round-trip route with only half the number of qubits consumed compared to IBM Q’s approach.We argue the formalization approach presented in this paper would lead to a generalized framework for finding,in the context of QAOA,high-quality approximate solutions to NP optimization problems.
基金partially supported by the National Natural Science Foundation of China(Nos.61333001 and 61473099)
文摘In the interception engagement,if the target movement information is not accurate enough for the mid-course guidance of intercepting missiles,the interception mission may fail as a result of large handover errors.This paper proposes a novel cooperative mid-course guidance scheme for multiple missiles to intercept a target under the condition of large detection errors.Under this scheme,the launch and interception moments are staggered for different missiles.The earlier launched missiles can obtain a relatively accurate detection to the target during their terminal guidance,based on which the latter missiles are permitted to eliminate the handover error in the mid-course guidance.A significant merit of this scheme is that the available resources are fully exploited and less missiles are needed to achieve the interception mission.To this end,first,the design of cooperative handover parameters is formulated as an optimization problem.Then,an algorithm based on Monte Carlo sampling and stochastic approximation is proposed to solve this optimization problem,and the convergence of the algorithm is proved as well.Finally,simulation experiments are carried out to validate the effectiveness of the proposed cooperative scheme and algorithm.
文摘Control systems designed by the principle of matching gives rise to problems of evaluating the peak output. This paper proposes a practical method for computing the peak output of linear time-invariant and non-anticipative systems for a class of possible sets that are characterized with many bounding conditions on the two- and/or the infinity-norms of the inputs and their derivatives. The original infinite-dimensional convex optimization problem is approximated as a large-scale convex programme defined in a Euclidean space, which are associated with sparse matrices and thus can be solved efficiently in practice. The numerical results show that the method performs satisfactorily, and that using a possible set with many bounding conditions can help to reduce the design conservatism and thereby yield a better match.
基金Project supported by the National Natural Science Foundation ofChina (No. 60473130)the National Basic Research Program(973) of China (No. G2004CB318000)
文摘This paper presents a quadratic programming method for optimal multi-degree reduction of B6zier curves with G^1-continuity. The L2 and I2 measures of distances between the two curves are used as the objective functions. The two additional parameters, available from the coincidence of the oriented tangents, are constrained to be positive so as to satisfy the solvability condition. Finally, degree reduction is changed to solve a quadratic problem of two parameters with linear constraints. Applications of degree reduction of Bezier curves with their parameterizations close to arc-length parameterizations are also discussed.
文摘In this paper we first consider the existence and the general form of solution to the following generalized inverse eigenvalue problem(GIEP): given a set of n-dimension complex vectors {x j}m j=1 and a set of complex numbers {λ j}m j=1, find two n×n centrohermitian matrices A,B such that {x j}m j=1 and {λ j}m j=1 are the generalized eigenvectors and generalized eigenvalues of Ax=λBx, respectively. We then discuss the optimal approximation problem for the GIEP. More concretely, given two arbitrary matrices, , ∈C n×n, we find two matrices A and B such that the matrix (A*,B*) is closest to (,) in the Frobenius norm, where the matrix (A*,B*) is the solution to the GIEP. We show that the expression of the solution of the optimal approximation is unique and derive the expression for it.
基金National Natural Science Foundation of China ( No. 60875007)
文摘The matrix equations (AX, XBH)=(C, DH) have been widely used in structural design, parameter identification, linear optimal control, and so on. But few researches studied the reflexive solutions. A new approach for the reflexive solutions to the matrix equations was proposed. By applying the canonical correlation decomposition (CCD) of matrix pairs, the necessary and sufficient conditions for the existence and the general expression for the reflexive solutions of the matrix equations (AX, XBH)=(C, DH) were established. In addition, by using the methods of space decomposition, the expression of the optimal approximation solution to a given matrix was derived.
基金The work was supported by the National Natural Science Foundation of China(No.11571171)。
文摘The problem of correcting simultaneously mass and stiffness matrices of finite element model of undamped structural systems using vibration tests is considered in this paper.The desired matrix properties,including satisfaction of the characteristic equation,symmetry,positive semidefiniteness and sparsity,are imposed as side constraints to form the optimal matrix pencil approximation problem.Using partial Lagrangian multipliers,we transform the nonlinearly constrained optimization problem into an equivalent matrix linear variational inequality,develop a proximal point-like method for solving the matrix linear variational inequality,and analyze its global convergence.Numerical results are included to illustrate the performance and application of the proposed method.
文摘A novel numerical method is presented to update mass and stiffness matrices simultaneously with measured vibration data by means of the combined acceleration and displacement output feedback.By the method,the required displacement and acceleration output feedback gain matrices are determined,and thus the optimal approximation mass matrix and stiffness matrix which satisfy the required orthogonality relation and eigenvalue equation are found.The proposed method is computationally efficient and the updated mass and stiffness matrices are also symmetric and have the compact expressions.The numerical example shows that the proposed method is reliable and attractive.
文摘The least-square solutions of inverse problem for anti-symmetric and skew-symmetric matrices are studied. In addition, the problem of using anti-symmetric and skew-symmetric matrices to construct the optimal approximation to a given matrix is discussed, the necessary and sufficient conditions for the problem are derived, and the expression of the solution is provided. A numerical example is given to show the effectiveness of the proposed method.
