Questions tagged [unconstrained-optimization]
The unconstrained-optimization tag has no usage guidance.
8
questions
4
votes
2
answers
160
views
How to approximate an uncertain constraint?
Suppose $\theta$ is the uncertain vector of parameters and it varies within the interval $\Theta$. We have the following uncertain constraint.
$$
\sum_{i} f_i(x,\theta) \ge \sum_{j} g_j(x,\theta) \...
3
votes
1
answer
139
views
How to exponentiate binary variables in QUBO-type problems?
Ising Model
In an Ising model, the Hamiltonian of one configuration of spins $\vec{s}$ is:
$$ H(\vec{s}, \mathcal{J}, \mathcal{h}) = \sum_{i} h_{i} s_{i} + \sum_{i \ne j}J_{ij} s_{i}s_{j} $$
where ...
7
votes
2
answers
298
views
Inverse Ising problem
Inverse Ising Problem
The inverse ising problem means fitting the coupling $J_{ij}$ and field $h_{i}$ parameters given a sample of configurations of spins.
Each spin $s_{i}$ is either +1 or -1. The ...
3
votes
1
answer
211
views
How do I arrive at the form given in this paper, for the QUBO version of the number partitioning problem?
In this article A new modeling and solution approach for the number partitioning problem1, it transforms the number partition problem into a QUBO form like equation (2.1) on page 2. $$\text{diff}=\...
4
votes
1
answer
317
views
Why are the bounds 3 and 6 instead of 7, in this binary expansion of a slack variable in this QUBO problem?
I've recently started to study how to formulate optimization problems as QUBO models through this paper/tutorial: https://arxiv.org/pdf/1811.11538.pdf
One of the steps is to transform the inequalities ...
0
votes
1
answer
69
views
Trouble implementing a line-search algorithm
I am trying to implement a simple line-search algorithm in Julia. I am new to Julia programming, so I am learning it on the go. I'd like to ask for some help, if possible, to correct an error while ...
8
votes
1
answer
176
views
Speed of convergence for minimizing Rosenbrock's function
I am minimizing $f(x_1,x_2) = 100(x_2-x_1^2)^2 + (1-x_1)^2$, where I try many algorithms to compare with each other. All of the algorithms find the optimal solution $(1,1)$ quickly, so I am not ...
11
votes
1
answer
276
views
Armijo Line Search Parameters
I am trying to compare many unconstrained optimization algorithms like gradient method, Newton method with line search, Polak-Ribiere algorithm, Broyden-Fletcher-Goldfarb-Shanno algorithm, so on so ...