相关论文: Orbital optimization in the perfect pairing hierar…

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…

We introduce the quadratic balanced optimization problem (QBOP) which can be used to model equitable distribution of resources with pairwise interaction. QBOP is strongly NP-hard even if the family of feasible solutions has a very simple…

We propose a family of recursive cutting-plane algorithms to solve feasibility problems with constrained memory, which can also be used for first-order convex optimization. Precisely, in order to find a point within a ball of radius…

We develop a theory of finite-dimensional polyhedral subsets over the Wasserstein space and optimization of functionals over them via first-order methods. Our main application is to the problem of mean-field variational inference, which…

Fully pairing all elements of a set while attempting to maximize the total benefit is a combinatorically difficult problem. Such pairing problems naturally appear in various situations in science, technology, economics, and other fields. In…

Topology optimization of frame structures under free-vibration eigenvalue constraints constitutes a challenging nonconvex polynomial optimization problem with disconnected feasible sets. In this article, we first formulate it as a…

This paper deals with maximum entropy completion of partially specified block-circulant matrices. Since positive definite symmetric circulants happen to be covariance matrices of stationary periodic processes, in particular of stationary…

In this study, we describe a procedure of topology optimization in the framework of the linear Boltzmann equation, implemented using a reference Monte-Carlo particle transport code. This procedure can design complex structures that optimize…

Many parametrization and mapping-related problems in geometry processing can be viewed as metric optimization problems, i.e., computing a metric minimizing a functional and satisfying a set of constraints, such as flatness. Penner…

If an orbit is fitted from combined RV and astrometric data, the orbit should be physically consistent with both data sets. The Keplerian orbit of a planet is a highly nonlinear function of seven parameters. The astrometric orbit problem…

We present a model development framework and numerical solution approach to the general problem-class of packing convex objects into optimized convex containers. Specifically, here we discuss the problem of packing ovals (egg-shaped…

We report the derivation and implementation of orbital optimization algorithms for the active space decomposition (ASD) model, which are extensions of complete active space self-consistent field (CASSCF) and its occupation-restricted…

Finite element methods usually construct basis functions and quadrature rules for multidimensional domains via tensor products of one-dimensional counterparts. While straightforward, this approach results in integration spaces larger than…

We propose the Particle Swarm Optimization (PSO) as an alternative method for locating periodic orbits in a three--dimensional (3D) model of barred galaxies. We develop an appropriate scheme that transforms the problem of finding periodic…

A non-linear conjugate gradient optimization scheme is used to obtain excitation energies within the Random Phase Approximation (RPA). The solutions to the RPA eigenvalue equation are located through a variational characterization using a…

A new approach is presented for the problem of optimal impulsive rendezvous of a spacecraft in an inertial frame near a circular orbit in a Newtonian gravitational field. The total characteristic velocity to be minimized is replaced by a…

We provide an integration of the universal, perturbative explicitly correlated [2]$_\text{R12}$-correction in the context of the Variational Quantum Eigensolver (VQE). This approach is able to increase the accuracy of the underlying…

We give noise-robust, Probably Approximately Correct (PAC) guarantees of global $\varepsilon$-optimality for the Variational Quantum Eigensolver under explicit geometric conditions. For periodic ansatzes with bounded generators -- yielding…

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…

Multi-dimensional optimization is widely used in virtually all areas of modern astrophysics. However, it is often too computationally expensive to evaluate a model on-the-fly. Typically, it is solved by pre-computing a grid of models for a…