相关论文: Frustrated Systems: Ground State Properties via Co…

In this review article, we discuss connections between the physics of disordered systems, phase transitions in inference problems, and computational hardness. We introduce two models representing the behavior of glassy systems, the spiked…

The frustrated Ising model on a two-dimensional lattice with open boundary conditions is revisited. A hidden Z2 gauge symmetry relates models with different frustrations which, however, share the same partition function. By means of a…

We demonstrate that a recently introduced heuristic optimization algorithm [Phys. Rev. E 83, 046709 (2011)] that combines a local search with triadic crossover genetic updates is capable of sampling nearly uniformly among ground-state…

Using Domain Decomposition (DD) algorithm on non--overlapping domains, we compare couplings of different discretisation models, such as Finite Element (FEM) and Reduced Order (ROM) models for separate subcomponents. In particular, we…

This paper studies a class of distributed optimization problems with coupled equality constraints in networked systems. Many existing distributed algorithms rely on solving local subproblems via the $\operatorname{argmin}$ operator in each…

We present a general technique to compute how the energy of a configuration varies as a function of its overlap with the ground state in the case of optimization problems. Our approach is based on a generalization of the cavity method to a…

Planning for legged-wheeled machines is typically done using trajectory optimization because of many degrees of freedom, thus rendering legged-wheeled planners prone to falling prey to bad local minima. We present a combined sampling and…

Optimization algorithms can be interpreted through the lens of dynamical systems as the interconnection of linear systems and a set of subgradient nonlinearities. This dynamical systems formulation allows for the analysis and synthesis of…

We consider an optimization problem related to semi-active damping of vibrating systems. The main problem is to determine the best damping matrix able to minimize influence of the input on the output of the system. We use a minimization…

The sensitivity of the random field Ising model to small random perturbations of the quenched disorder is studied via exact ground states obtained with a maximum-flow algorithm. In one and two space dimensions we find a mild form of chaos,…

Optimization networks are a new methodology for holistically solving interrelated problems that have been developed with combinatorial optimization problems in mind. In this contribution we revisit the core principles of optimization…

This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…

This paper demonstrates that a computer aided perturbation theory can easily be realized by use of a cumulant approach. In contrast to a recent alternative formulation on the basis of Wegner's flow equation method the present approach can…

Here is proposed a general subgraph-based method for efficiently sampling certain graphical models, typically using subgraphs of a fixed treewidth, and also a related method for finding minimum energy (ground) states. In the case of models…

The paper focuses on some versions of connected dominating set problems: basic problems and multicriteria problems. A literature survey on basic problem formulations and solving approaches is presented. The basic connected dominating set…

The chapter starts with a historical summary of first attempts to optimize the spin glass Hamiltonian, comparing it to recent results on searching largest cliques in random graphs. Exact algorithms to find ground states in generic spin…

Random cost simulations were introduced as a method to investigate optimization problems in systems with conflicting constraints. Here I study the approach in connection with the training of a feed-forward multilayer perceptron, as used in…

All ground states and low-lying excitations of a +/- I Ising spin glass model on a cubic 4 x 4 x 4 lattice with periodical boundary conditions were calculated using a method of combinatorical optimization. The structure of states in the…

A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems…

Geometric frustration, arising from competing interactions that prevent simultaneous energy minimization, presents a fundamental challenge for variational quantum algorithms applied to quantum many-body systems. We investigate the…