# Tag Info

Accepted

While iteratively approximately solving the first order Karush-Kuhn-Tucker conditions, many (nonconvex) nonlinear solvers "roll downhill", i.e., enforce descent (for minimization) of the objective ...
• 13.4k

### How to determine different gap rates?

MIP solvers such as CPLEX & Gurobi indicate a gap (in %) between the current best solution and the current best dual bound (which is a lower bound for a minimization problem). In general, the ...
• 4,173

### Optimality in a simultaneous column and row generation procedure

As you are probably aware of, the standard optimality condition for column generation is not valid if not all constraints are included in the master problem, as the dual information of the missing ...
• 2,325

### How to determine different gap rates?

Gaps are typically tied to specific models and solution methods. The gap reflects the difference between the best known bound and the objective value of the best solution produced by a particular ...
• 39.3k
Accepted

### Optimality in L Shaped or Bender Decomposition

As far as I can see you have binary variables in the first stage and general integer variables in the second stage. This means that classical Benders cuts (based on duality of the subproblems) do not ...
• 1,671

### Conditions for minima in calculus of variations

It is possible to apply the notions of stationary points and the second derivative of a function to functionals. For $|\varepsilon|\ll1$ and and a differentiable function $h$, we can write, using ...
• 5,412

### Conditions for minima in calculus of variations

Coming from the world of optimal control, I tend to view the calculus of variations from a Pontryagin point of view. The conditions stated by Pontryagin are necessary, and sufficient under certain ...
• 1,511
Accepted

### Existence of Optimal Solution

No, an optimal solution need not exist. Take $f: \mathbb{R} \to \mathbb{R}$ with $f(x) = e^{x}$. However if you restrict $S$ to be compact instead of just closed, then you are guaranteed a solution. ...
Accepted

### Minimize $\int_0^\infty g'(x)f(x)\,dx$ where $f(x)$ has a log-normal density

Proposition. There is no minimiser. Proof: An equivalent version of your problem is as follows. Statement. We wish to minimise $$\int_{-\infty}^\infty xe^{q(x)-x^2}\,dx$$ where $q(x)$ is a strictly ...
• 5,412

### How to determine different gap rates?

A short little note about computing gaps just appeared in 4OR: Laporte, G., Toth, P. A gap in scientific reporting. 4OR-Q J Oper Res (2021). https://doi.org/10.1007/s10288-021-00483-0
• 3,451

### Is optimal solution to dual not unique if optimal solution to the primal is degenerate?

If I understand your question correctly, I think you can find your answer by considering the following two primal problems. The first is \begin{alignat*}{2} & \max & x_{1}\\ & \textrm{s....
• 39.3k

### Promising regions in optimization

The concept of promising regions (unlike many other concepts in optimization) doesn't have a mathematical definition. It is more an analogy people use to justify why exploring someĀ¹ neighborhood of ...
• 4,007

### Difference between Optimality cuts and Feasibility cuts for L shaped method in stochastic programming?

Given a certain master problem solution, when the subproblem is infeasible, a feasibility cut is added to the master problem. On the other hand, an optimality cut is added to the master problem when ...
• 764

### Global optimality condition of non-convex quadratic programs

In addition to the references already given in the comments, this paper (DOI link) demonstrates that exact solutions to some non-convex quadratic programs are given by semi-definite programming, and ...
• 1,122

### Local optimum of dual of non-linear program

I guess you are assuming that the dual problem was obtained by only dualizing some of the constraints. The answer below makes sense if I am right about my guess. In general, I believe the answer to ...
• 1,508

### Local optimum of dual of non-linear program

From duality theory: At each feasible $x$,$f(x)=\sup_{u>0,v}L(x,u,v)$, and the supremum is taken iff $u\geq 0$ satisfying $u_ih(x)=0,i=1,...,m$. The optimal value of the primal problem, named as \$f^...
• 12.1k

### Global optimality condition of non-convex quadratic programs

With the exception of special cases, this problem is NP-hard. One interesting case is that minimizing a convex or concave function over a simplex can be solved in polynomial time. In other special ...
• 12.1k
Accepted

### How to prove pseudo-convexity of a discrete function?

For a continuous function, all you need to do is prove that it's (i) non-convex, and (ii) monotonic. (i) can be shown using the eigenvalues of the hessian matrix, and (ii) using the gradient. However, ...
• 12.1k
1 vote

### Finding primal feasible solution from optimal dual

When Boyd refers to "regularizing the subproblems," he is likely referring to techniques that improve the numerical stability and convergence properties of the subproblem solvers in the ...
• 194

Only top scored, non community-wiki answers of a minimum length are eligible