Let $ N(x_0,r)$ be half a sphere in $\mathbb{R}^{3n}$ centered at $x_0$ and has radius $r$, and consider the function $U:\mathbb{R}^{3n}\to \mathbb{R}$ (This is an empirical potential for a cluster of $n$ particles, e.g Lennard Jones potential is defined via $$ U(x) =4 \epsilon \sum_{i<j}^n \left(\left[\frac{\sigma}{r_{ij}}\right]^{12}-\left[\frac{\sigma}{r_{ij}}\right]^{6}\right) $$ where $\epsilon$ and $\sigma$ are constants and $r_{ij}=$ distance between particles $i$ and $j$.) How one should think about this constrained minimization problem in $3n-1$ dimensions: $$ \text{Find }x\in N(x_0,r)\text{ such that }\quad U(x)+U(2x_0-x)=\min_{y\in N(x_0,r)} [U(y)+U(2x_0-y)] $$ What methods should I use to solve it?
2026-03-25 13:55:23.1774446923
What is the best way to minimize this constrained expression? Does it have a minimizer? Is it unique?
117 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- optimization with strict inequality of variables
- Gradient of Cost Function To Find Matrix Factorization
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Building the model for a Linear Programming Problem
- Maximize the function
- Transform LMI problem into different SDP form
Related Questions in NUMERICAL-METHODS
- The Runge-Kutta method for a system of equations
- How to solve the exponential equation $e^{a+bx}+e^{c+dx}=1$?
- Is the calculated solution, if it exists, unique?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Minimum of the 2-norm
- Is method of exhaustion the same as numerical integration?
- Prove that Newton's Method is invariant under invertible linear transformations
- Initial Value Problem into Euler and Runge-Kutta scheme
- What are the possible ways to write an equation in $x=\phi(x)$ form for Iteration method?
- Numerical solution for a two dimensional third order nonlinear differential equation
Related Questions in NONLINEAR-OPTIMIZATION
- Prove that Newton's Method is invariant under invertible linear transformations
- set points in 2D interval with optimality condition
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Sufficient condition for strict minimality in infinite-dimensional spaces
- Weak convergence under linear operators
- Solving special (simple?) system of polynomial equations (only up to second degree)
- Smallest distance to point where objective function value meets a given threshold
- KKT Condition and Global Optimal
- What is the purpose of an oracle in optimization?
- Prove that any Nonlinear program can be written in the form...
Related Questions in CONSTRAINT-PROGRAMMING
- A minimization chance constrained optimization problem
- Reducing the set of constraints in an optimization problem
- How to formulate the constrained optimization problem?
- How to solve a linear program with some infeasible constraints?
- How does terminal constraint lead to degeneracy?
- Linear optimization with rotation matrix constraint
- Team optimization with constraints
- How to deal with Constraints having Large or Infinite Domains.
- Is it possible to check quality of solution in an optimization problem? If yes, how?
- Does redundancy removal in linear programming follow a distributive property?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
With no loss in generality, we can set $x_0$ to $0$. Simply translate the system. Also with no loss in generality, we can imagine a sphere of $2n$ particles in a sphere centered at zero arranged in a pattern that has inversion symmetry (for every particle at $y$, there is another at $-y$).
This is a highly nonconvex minimization problem. It's not going to be easy to solve. Whether or not the solution is unique totally depends on the positions of these particles.
For each particle, there is an optimal distance $\rho$ you can be from it. However being at an optimal distance from one, may mean you're not at the ideal distance from another.
Example of uniqueness: Say that optimal distance is actually $\rho=r$! If all particles are arranged at the curved boundary of the sphere, the unique minimum is the origin.
Example of non-uniqueness: Say that we have $\rho$ much larger than $r$. You're going to want to be as far away from the particles are you can be. Say there are two particles: on at the "north pole" and one at the "south pole". Then the minimum is going to be any point on the "equator" of the sphere.
Existence: A minimum will always exist. Exclude a tiny radius around each particle where you know a minimum is never going to exist. If you remove all these spheres from your big sphere, then potential is a continuous function over a compact region, and therefore there will always be a minimizer. It can be proven that this minimizer can never be on the boundary of any of these little spheres. Therefore it is a minimizer over the entire sphere, and not just the restricted region. Therefore a minimizer must exist.