Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation

DOI10.1137/16M1069146zbMath1386.49014arXiv1511.03354MaRDI QIDQ4608088

Mahdi Bandegi, David Shirokoff

Publication date: 15 March 2018

Published in: SIAM Journal on Applied Dynamical Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.03354

zbMATH Keywords

semidefinite programmingconvex relaxationsglobal minimizersnonconvex energyself-assemblyflockingconic programmingpairwise interactions

Mathematics Subject Classification ID

Related Items (4)

Note on crystallization for alternating particle chains ⋮ On the spectral gap of a square distance matrix ⋮ Minimizing lattice structures for Morse potential energy in two and three dimensions ⋮ Aggregation-diffusion to constrained interaction: minimizers \& gradient flows in the slow diffusion limit

Uses Software

• Wirtinger Flow

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlocal-interaction equations on uniformly prox-regular sets
• Dimensionality of local minimizers of the interaction energy
• Confinement for repulsive-attractive kernels
• Solving quadratic equations via phaselift when there are about as many equations as unknowns
• Crystallization for a Brenner-like potential
• Ground state at high density
• On the crystallization of 2D hexagonal lattices
• A proof of crystallization in two dimensions
• Density matrix minimization with \({\ell}_1\) regularization
• On minimizers of interaction functionals with competing attractive and repulsive potentials
• Global minimum potential energy conformations of small molecules
• Efficient algorithms for large scale global optimization: Lennard-Jones clusters
• Geometry of minimizers for the interaction energy with mildly repulsive potentials
• Mutual interactions, potentials, and individual distance in a social aggregation
• Deterministic global optimization. Theory, methods and applications
• Sufficient conditions for global minimality of metastable states in a class of non-convex functionals: a simple approach via quadratic lower bounds
• Existence of ground states of nonlocal-interaction energies
• Existence of compactly supported global minimisers for the interaction energy
• Convex optimization for the planted \(k\)-disjoint-clique problem
• Phase recovery, MaxCut and complex semidefinite programming
• Nonlocal Aggregation Models: A Primer of Swarm Equilibria
• PREDICTING PATTERN FORMATION IN PARTICLE INTERACTIONS
• Heterophilious Dynamics Enhances Consensus
• On global minimizers of repulsive–attractive power-law interaction energies
• Phase Retrieval via Wirtinger Flow: Theory and Algorithms
• Blind Deconvolution Using Convex Programming
• A Variational Approach to Copositive Matrices
• Convergence of Regularized Nonlocal Interaction Energies
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Scaling law for recovering the sparsest element in a subspace
• A simple closure condition for the normal cone intersection formula
• Asymptotic Dynamics of Attractive-Repulsive Swarms
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Convex Analysis

This page was built for publication: Approximate Global Minimizers to Pairwise Interaction Problems via Convex Relaxation