The tag has no usage guidance.

learn more… | top users | synonyms

0
votes
0answers
16 views

How to solve a model with a quadratic term in the objective function on CPLEX?

I introduced a model with a quadratic objective function in CPLEX but it takes a long time to solve it, I think there is a way to tell CPLEX that the model has a quadratic objective function, but I ...
0
votes
0answers
49 views

What is the fastest method for solving a quadratic programm repeatedly,( warmstarted)?

I have a quadratic problem, \begin{align} \min_{x\in [0,1]^n} x^T p+ \frac{1}{2\lambda} x^T Q x \end{align} ($Q$ is semidefinite) which I want to solve repeatedly, with the slight change of p and Q, ...
0
votes
0answers
21 views

Admissible box constraint for a quadratically constrained linear program

I am looking at a real-world resource allocation problem that is cast as a quadratically-constrained linear program of the form $$ \max\langle f,x\rangle $$ subject to $$ \begin{aligned} m \leq\,\, &...
1
vote
1answer
115 views

How to efficently solve: min $\sum_{ij}(a_{ij}x_{ij}^2 + b_{ij}x_{ij})$ s.t

I am trying to solve the following problem, where $a_{ij} \ge 0 \ \forall i,j$: \begin{align} \mbox{minimize}\quad & \sum_{i=1}^m\sum_{j=1}^n (a_{ij}x_{ij}^2 + b_{ij}x_{ij})\\ \mbox{subject to}\...
1
vote
1answer
136 views

Reformulation of optimization problem

I am looking for some helps concerning an optimization problem. I have an optimization problem defined on two sets $\mathcal{X}=\{x_i\}_{i=1}^n $ and $\mathcal{Y}=\{y_j\}_{j=1}^m $ and described as ...
6
votes
1answer
115 views

Algorithm for solving system of quadratic equations and linear equations

Let $x \in R^N$. From a Spectral Chebyshev collocation method, I have a system of quadratic and linear equations. Denote them, $$ x^T Q_i x + L_i^T x = 0 $$ and $$ A x = 0 $$ Furthermore, I know ...
3
votes
0answers
103 views

Eigenvalue-style optimization with quadratic constraints

Suppose $A\in\mathbb{R}^{n\times n}$ is symmetric and positive definite and that we have several symmetric matrices $B_i\in\mathbb{R}^{n\times n}$ that are low-rank and indefinite. I need an ...
4
votes
2answers
276 views

How to determine whether two cylinders intersect or not?

Considering any two cylinders, defined as: the center of their bottoms $A_i$, the radius of their bottom $R_i$, the unit vector $W_i$ of their axis direction, and the length $L_i$ of the cylinders, ...
1
vote
1answer
87 views

How to formulate variance minimization as a mixed integer quadratic program

I have a mixed integer quadratic problem and my objective function is as follows $$\arg \min \operatorname{Var}(f(x),g(x)) + \operatorname{Var}(c(x),d(x)) + \cdots$$ where $f$, $g$, $c$ $d$ are ...
0
votes
1answer
58 views

Can Variance be replaced by absolute value in this optimization problem

Initially I modeled my objective function as $$\arg \min \operatorname{Var}(f(x),g(x)) + \operatorname{Var}(c(x),d(x)) + \cdots$$ where $f$, $g$, $c$, $x$ are linear functions. To be able to solve ...
1
vote
1answer
311 views

Convex Optimization problem with sum of absolute value constraints

How to solve the optimization problem written below? $$\begin{align} &\operatorname{argmax}\limits_{a}\; a^T b - \frac{1}{2} a^T X a\\ &\text{subject to } \sum_i |a_i|=4,\; \sum_i a_i = 0 \...
2
votes
0answers
48 views

Disjunctive programming software

Can you advise me any kind of existing software that can help to solve the disjunctive programming problem? The problem is the following. We have unit 3D planes $\Pi_{1}, \ldots, \Pi_{N}$ (they are ...
0
votes
0answers
29 views

can I cast $\mathrm{vec}(X^TX)$ with matrix $X$ into quadratic form of $\mathrm{vec}(X)$

I want to cast $\min \mathrm{tr}\,J(X^TX-C)$ where $J=$ all one's matrix (this is just sum of all elements in $X^TX-C$) with matrix $X$ into standard quadratic program. The natural way is to use $\...
2
votes
1answer
133 views

Solve $AX = B$ where $X^T X = C$

Is there a natural way to find the solution to $$AX = B, X^TX = C \enspace \text{?}$$ $X$ is a matrix and has a small number of rows, and $A$ is sparse. An approximate solution would be fine.
1
vote
2answers
135 views

Solving absolute value quadratic optimization problem

would you please help me to solve following problem $$x^*= \text{argmin}\ xLx^T+ |P^Tx|$$ $x$ is binary $P$ is a known vector (with positive and negative values) $L$ is Laplacian matrix I have ...
0
votes
2answers
127 views

Convex quadratic problem solver gives different answers?

I am pretty sure that the following variance objective function should be a convex quadratic problem. My objective function is as follows: $$ \text{argmin } \text{var }(X*L) \xi \geq 1, \text{ where }...
2
votes
1answer
132 views

Solving the quadratic in the Fast Iterative Method

The Fast Iterative Method is a way of solving the Eikonal Equation on a discrete grid, similar to the Fast Marching Method discussed in another question here. The paper describes the overall ...
1
vote
1answer
158 views

Mixed-integer quadratic programming, state of art [closed]

I used Gurobi with a MIQP with 26 binary variables and 26*4 interaction term without any other constraint. The speed is very slow already.... I want to ask what is the state of art of MIQP solvers. ...
1
vote
3answers
413 views

Minimize quadratic form with equality constraints

I want to minimize function: $f(x) = x^T \cdot A \cdot x + b \cdot x$ given constraints: $B \cdot x = 0$. Here: $x$ is a vector ($x \in \mathbb{R}^n$), $A$ is a matrix of size $n \times n$, $b$ ...
1
vote
3answers
149 views

rank-deficient NNLS

I want to find the minimum-norm solution to a rank-deficient least-squares problem, subject to positivity constraints, e.g. $$\min_x\ \|x\|^2 \quad s.t.\quad Ax = b,\ x \geq 0$$ where $A$ is large, ...
2
votes
1answer
191 views

0,1 binary polynomial programming

Is there a mathematical optimization branch that explicitly tries to optimize this (type) problem? $$\eqalign{ & \min \cr & \sum\limits_{i = 1}^N {(J*s[i] + {J_1}*s[i]*s[i + 1] + {J_2}...
1
vote
1answer
178 views

How can a quadratic positive definite minimization be unbounded [closed]

I am minimising a diagonal quadratic matrix using CPLEX. All off diagonal elements are zero. It has 500 variables and 20 linear constraints plus each variable is constrained to be within 0 and 1 All ...
3
votes
2answers
105 views

A separable nonnegative quadratic program

I have spent quite some time trying to solve the following quadratic program: $$\min \sum_{i=1}^n (\frac{1}{2}x_i^TQx_i+c_i^Tx_i), \quad \mathrm{s.t. } \quad x_i\ge 0 \quad \forall i,$$ where $n$ is ...
0
votes
1answer
473 views

CPLEX claims to have solved QP minimisation but solution is not optimal

I am trying to solve a small QP problem in CPLEX. The problem has several linear constraints. The optimiser runs and finds a solution which satisfies these constraints and CPLEX returns a success code....
3
votes
1answer
280 views

Sparse quadratic programming solver

For a hobby project I need to solve a series of quadratic programming problems each with about 500 variables about 1000 constraints, each of the form $x_i-x_j\le c_{ij}$ the objective function is ...
4
votes
3answers
118 views

Plane constraints in R3

I have multiple plane constraints in $\mathbb{R}^3$ of the form: $$n_i \cdot x \ge \delta_i$$ Where $n_i$ is the $i$th plane normal (in form (x, y, z)), $x$ is a point in space, and $\delta_i$ is ...
0
votes
0answers
155 views

Numerical integral with a weakly singular kernel with a satisfactory precision

I am working on numerical method for time fractional PDE. One problem is that I must compute numerical integral with the following form: \begin{equation} \int_0^{t_m} (t_m-s)^{-\beta}f(s)ds \end{...
1
vote
1answer
257 views

Quadratic Programming bound constraints

I have a quadratic programming problem with constraints of the general form: Minimize w.r.t. x: f(x) = (1/2) x^T * Q * x + c^T * x subject to one or more ...
4
votes
1answer
484 views

Solver suggestion for many small quadratic problem in C++

I have a C++ program/model that in some parts already use IPOPT (with ADOL-C and ColPack) to solve some pretty large non linear problems. Now in an other part of the program I need to solve a large ...
0
votes
0answers
107 views

Quadratic programming problem involving permutation matrices

Does anyone know a good algorithm for quickly finding an approximate solution to the following problem? Given two square matrices $A$ and $B$, minimize $\| P A P^\top - B \|$ over all permutation ...
0
votes
1answer
281 views

Modeling a quadratic constraint with a linear expression

In a problem I am trying to model with a MIP program, the following scenario occurs: I am given binary variables $x_1,\ldots,x_n$ and $y_1,\ldots,y_n$ which can really be regarded as $n$-vectors. ...
1
vote
0answers
90 views

Quadratic optimization without any cross terms

I need to solve a quadratic program in Java which minimizes a sum of squares. The problem is that there are constraints to be satisfied, and so a quadratic optimizer must be used. I've been thinking ...
3
votes
2answers
335 views

Quadratic Programming: Quadprog

Given a real-rectangular matrix $S$ and inorder to solve this simple quadratic programming problem: Minimize $w'S'Sw = ||S w||^2$ over $w$ subject to $e^Tw = 1$ and $w \geq 0$ using a solver I ...
1
vote
0answers
114 views

Cplex C++ Interface: Repeated calls of setQuadCoef are slow. Is there an alternative?

I noticed that repeated calls of the member function setQuadCoef of the class IloObjective can be prohibitively slow. The Cplex ...
3
votes
2answers
283 views

Solver for a MIQP with an indefinite coefficient matrix

Do CPLEX or Gurobi handle MIQPs with indefinite coefficient matrices? The problem I am dealing with has quadratic terms in which one variable is binary and the other variable is continuous. The ...
4
votes
1answer
1k views

Why does MATLAB's quadprog outperform MOSEK for my problem?

For a problem I am trying to solve it appears MOSEK's Quadratic Program solver is 100 times slower than MATLAB's Interior Point solver. Has anyone encountered this behavior in the past, or maybe ...
2
votes
2answers
637 views

Quadratic program With Linear Constraint vs. Eigen Decomposition Time Complexity-Comparison. Which is faster?

Say I had the choice of choosing one out of the following two optimization problems which I could use to solve my problem. Which choice is the fastest? How much of a trade-off would it be-as in - Is ...
5
votes
2answers
153 views

What is a suitable algorithm for solving a large mixed-integer quadratic program?

I am interested in the solutions of a very large quadratic programming (QP) problem \begin{align} \min_{x \in \mathbb{R}^n} & x^T Q x\\ \mathrm{subject\ to} & A x = b\\ & x \in \{0,1\}^n \...
9
votes
2answers
1k views

Calculating Lagrange coefficients for SVM in Python

I'm trying to write a full SVM implementation in Python and I have a few issues computing the Lagrange coefficients. First let me rephrase what I understand from the algorithm to make sure I'm on the ...