Related papers: Efficient Optimization Method for Finding Minimum …
Researchers from Intel Corporation recently proposed "Magneto-Electric Spin Orbit (MESO)" logic as a new strategy for beyond-CMOS electronics [1]. The Intel researchers project that this concept has the potential to reduce the switching…
In this paper, we address the numerical solution of the Optimal Transport Problem on undirected weighted graphs, taking the shortest path distance as transport cost. The optimal solution is obtained from the long-time limit of the gradient…
Efficient path following for mobile manipulators is often hindered by high-dimensional configuration spaces and kinematic constraints. This paper presents a robust two-stage configuration planning framework that decouples the 8-DoF planning…
Starting from the recently proposed energy-based deviational formulation for solving the Boltzmann equation [J.-P. Peraud and N. G. Hadjiconstantinou, Phys. Rev. B 84, 2011], which provides significant computational speedup compared to…
This paper proposes a novel and efficient optimization-based method for generating near time-optimal trajectories for holonomic vehicles navigating through complex but structured environments. The approach aims to solve the problem of…
We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it…
Global optimization is an active area of research in atomistic simulations, and many algorithms have been proposed to date. A prominent example is basin hopping Monte Carlo, which performs a modified Metropolis Monte Carlo search to explore…
We study the 2-Disjoint Shortest Paths (2-DSP) problem: given a directed weighted graph and two terminal pairs $(s_1,t_1)$ and $(s_2,t_2)$, decide whether there exist vertex-disjoint shortest paths between each pair. Building on recent…
This paper outlines an energy-minimization finite-element approach to the computational modeling of equilibrium configurations for nematic liquid crystals under free elastic effects. The method targets minimization of the system free energy…
Fast computation of demagnetization curves is essential for the computational design of soft magnetic sensors or permanent magnet materials. We show that a sparse preconditioner for a nonlinear conjugate gradient energy minimizer can lead…
A solution to energy-efficient magnetization switching in a nanoparticle with biaxial anisotropy is presented. Optimal control paths minimizing the energy cost of magnetization reversal are calculated numerically as functions of the…
The motion of electrons under homogeneously applied electric fields in low-dimensional systems with non-zero off-diagonal effective mass (ODEM) is studied. The equation describing the time evolution of a probability coefficient of finding…
We consider move-making algorithms for energy minimization of multi-label Markov Random Fields (MRFs). Since this is not a tractable problem in general, a commonly used heuristic is to minimize over subsets of labels and variables in an…
Beam orientation optimization (BOO) is a key component in the process of IMRT treatment planning. It determines to what degree one can achieve a good treatment plan quality in the subsequent plan optimization process. In this paper, we have…
We apply the optimized-basis generator coordinate method (OptGCM) to sd-shell nuclei, $^{20}$Ne, $^{24}$Mg, and $^{28}$Si. This method variationally optimizes both the basis Slater determinants in the generator coordinate method (GCM) and…
Magnetization dynamics in magnetic materials is often modeled by the Landau-Lifshitz equation, which is solved numerically in general. In micromagnetic simulations, the computational cost relies heavily on the time-marching scheme and the…
This study addresses optimal impulsive trajectory design within the Circular Restricted Three-Body Problem (CR3BP), presenting a global optimization-based approach to identify minimum $\Delta V$ transfers between periodic orbits, including…
Lazy search algorithms can efficiently solve problems where edge evaluation is the bottleneck in computation, as is the case for robotic motion planning. The optimal algorithm in this class, LazySP, lazily restricts edge evaluation to only…
Szeliski et al. published an influential study in 2006 on energy minimization methods for Markov Random Fields (MRF). This study provided valuable insights in choosing the best optimization technique for certain classes of problems. While…
We formulate the swarming optimization problem as a weakly coupled, dissipative dynamical system governed by a controlled energy dissipation rate and initial velocities that adhere to the nonequilibrium Onsager principle. In this framework,…