Quantum computing,leveraging the properties of quantum physics such as quantum superposition and entanglement,possesses the potential for exponential acceleration compared to classical computing.It can significantly e...Quantum computing,leveraging the properties of quantum physics such as quantum superposition and entanglement,possesses the potential for exponential acceleration compared to classical computing.It can significantly enhance solution efficiency in topology optimization and effectively avoid the entrapment in local optima.This paper proposes a hybrid classical-quantum computing framework to solve the stress-constrained topology optimization problem for truss structures.Initially,structural analyses are performed on a classical computer to determine the stresses of truss members.Then,the optimization problem is formulated through incremental updates of member cross-sectional areas to make it compatible with a quantum annealer.The update strategy consists of a directional-control function and a magnitude-control function.By embedding stress constraints directly into the directional-control function,the original optimization problem is reformulated as a quadratic unconstrained binary optimization model suitable for quantum annealing.To realize a balance between solution accuracy and iteration efficiency,a dynamic strategy for adjusting the magnitude of area increments is proposed.Thus,the quantum annealer can effectively achieve the optimal solutions.When only the access time of the quantum processing unit is considered,the results from 2D and 3D examples of truss topology optimization validate the effectiveness of the proposed framework,and demonstrate the great potential of quantum computing in structural optimization.展开更多
Based on the nonmonotone line search technique proposed by Gu and Mo(Appl.Math.Comput.55,(2008)pp.2158-2172),a new nonmonotone trust region algorithm is proposed for solving unconstrained optimization problems in this...Based on the nonmonotone line search technique proposed by Gu and Mo(Appl.Math.Comput.55,(2008)pp.2158-2172),a new nonmonotone trust region algorithm is proposed for solving unconstrained optimization problems in this paper.The new algorithm is developed by resetting the ratioρk for evaluating the trial step dk whenever acceptable.The global and superlinear convergence of the algorithm are proved under suitable conditions.Numerical results show that the new algorithm is effective for solving unconstrained optimization problems.展开更多
An inexact Halley's method-Halley-PCG(preconditioned conjugate gradient)method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by prec...An inexact Halley's method-Halley-PCG(preconditioned conjugate gradient)method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by preconditioned conjugate gradient method approximately.The convergence result is given and the efficiency of the method compared to the improved Halley's method is shown.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.12032008,12102080,and 52378484)the National Key R&D Program of China(Grant No.2020YFB1709401).
摘要Quantum computing,leveraging the properties of quantum physics such as quantum superposition and entanglement,possesses the potential for exponential acceleration compared to classical computing.It can significantly enhance solution efficiency in topology optimization and effectively avoid the entrapment in local optima.This paper proposes a hybrid classical-quantum computing framework to solve the stress-constrained topology optimization problem for truss structures.Initially,structural analyses are performed on a classical computer to determine the stresses of truss members.Then,the optimization problem is formulated through incremental updates of member cross-sectional areas to make it compatible with a quantum annealer.The update strategy consists of a directional-control function and a magnitude-control function.By embedding stress constraints directly into the directional-control function,the original optimization problem is reformulated as a quadratic unconstrained binary optimization model suitable for quantum annealing.To realize a balance between solution accuracy and iteration efficiency,a dynamic strategy for adjusting the magnitude of area increments is proposed.Thus,the quantum annealer can effectively achieve the optimal solutions.When only the access time of the quantum processing unit is considered,the results from 2D and 3D examples of truss topology optimization validate the effectiveness of the proposed framework,and demonstrate the great potential of quantum computing in structural optimization.
基金been partially supported by National Natural ScienceFoundation of China(11071041,11201074)Fujian Natural Science Foundation(2013J01006)R&D of Key Instruments and Technologies for Deep Resources Prospecting(the NationalR&D Projects for Key Scientific Instruments)under grant number ZDYZ2012-1-02-04.
摘要Based on the nonmonotone line search technique proposed by Gu and Mo(Appl.Math.Comput.55,(2008)pp.2158-2172),a new nonmonotone trust region algorithm is proposed for solving unconstrained optimization problems in this paper.The new algorithm is developed by resetting the ratioρk for evaluating the trial step dk whenever acceptable.The global and superlinear convergence of the algorithm are proved under suitable conditions.Numerical results show that the new algorithm is effective for solving unconstrained optimization problems.
基金the Basic Research Foundation of Bering InstitU!e of Technology(200307A21)
摘要An inexact Halley's method-Halley-PCG(preconditioned conjugate gradient)method is proposed for solving the systems of linear equations for improved Halley method either by Cholesky factorization exactly or by preconditioned conjugate gradient method approximately.The convergence result is given and the efficiency of the method compared to the improved Halley's method is shown.