Large-scale semidefinite programs in electronic structure calculation
نویسندگان
چکیده
Employing the variational approach having the two-body reduced density matrix (RDM) as variables to compute the ground state energies of atomic-molecular systems has been a long time dream in electronic structure theory in chemical physics/physical chemistry. Realization of the RDM approach has benefited greatly from recent developments in semidefinite programming (SDP). We present the actual state of this new application of SDP as well as the formulation of these SDPs, which can be arbitrarily large. Numerical results using parallel computation on high performance computers are given. The RDM method has several advantages including robustness and provision of high accuracy compared to traditional electronic structure methods, although its computational time and memory consumption are still extremely large.
منابع مشابه
Semidefinite programs in electronic structure calculation
It has been a long-time dream in electronic structure theory in physical chemistry/chemical physics to compute ground state energies of atomic and molecular systems by employing a variational approach in which the two-body reduced density matrix (RDM) is the unknown variable. Realization of the RDM approach has benefited greatly from recent developments in semidefinite programming (SDP). We pre...
متن کاملSolving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
We present a dual-scaling interior-point algorithm and show how it exploits the structure and sparsity of some large scale problems. We solve the positive semideenite relaxation of combinatorial and quadratic optimization problems subject to boolean constraints. We report the rst computational results of interior-point algorithms for approximating the maximum cut semideenite programs with dimen...
متن کاملSolving large-scale semidefinite programs in parallel
We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedralsemidefinite subdifferential model, and other aspects related to parallelism) a...
متن کاملBandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods
In this paper, we consider the optimal design of photonic crystal band structures for twodimensional square lattices. The mathematical formulation of the band gap optimization problem leads to an infinite-dimensional Hermitian eigenvalue optimization problem parametrized by the dielectric material and the wave vector. To make the problem tractable, the original eigenvalue problem is discretized...
متن کاملBILGO: Bilateral greedy optimization for large scale semidefinite programming
Many machine learning tasks (e.g. metric and manifold learning problems) can be formulated as convex semidefinite programs. To enable the application of these tasks on a large-scale, scalability and computational efficiency are considered desirable properties for a practical semidefinite programming algorithm. In this paper, we theoretically analyse a new bilateral greedy optimization(denoted B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 109 شماره
صفحات -
تاریخ انتشار 2007