Presolver

From Wikimization

(Difference between revisions)
Jump to: navigation, search
Line 22: Line 22:
\end{array}
\end{array}
</math></center>
</math></center>
-
where <math>\,A</math> is a matrix of predetermined dimension, <math>\mathbb{Z}</math> represent the integers, <math>\reals</math> the real numbers,
+
where <math>\,A</math> is a matrix of predetermined dimension, <math>\mathbb{Z}</math> represents the integers, <math>\reals</math> the real numbers,
and <math>\mathcal{J}</math> is some possibly empty index set.
and <math>\mathcal{J}</math> is some possibly empty index set.
Line 30: Line 30:
==Geometry of Constraints==
==Geometry of Constraints==
-
The idea, central to our method for presolving, is more easily explained geometrically.
+
The idea, central to our method for presolving, is more easily understood geometrically.
Constraints
Constraints
<center><math>
<center><math>
Line 38: Line 38:
\end{array}
\end{array}
</math></center>
</math></center>
 +
suggest that a polyhedral cone is in play.
 +
Some geometers regard cones as convex Euclidean bodies that are semi-infinite in extent.
 +
In daily life, examples of finite polyhedral cones are the great Pyramids of Egypt
 +
while finite circular cones hold ice cream and block traffic.
 +
But a mathematician defines a polyhedral (semi-infinite) cone in <math>\,\reals^m</math> thus:
 +
<center><math>\mathcal{K}=\{A_{}x~|~x\succeq0\}</math></center>

Revision as of 22:14, 8 August 2011

Introduction

Presolving conventionally means quick elimination of some variables and constraints prior to numerical solution of an optimization problem. Presented with constraints LaTeX: a^{\rm T}x=0\,,~x\succeq0 for example, a presolver is likely to check whether constant vector LaTeX: \,a is positive; for if so, variable LaTeX: \,x can have only the trivial solution. The effect of such tests is to reduce the problem dimensions.

Most commercial optimization problem solvers incorporate presolving. Particular reductions can be proprietary or invisible, while some control or selection may be given to a user. But all presolvers have the same motivation: to make an optimization problem smaller and (ideally) easier to solve. There is profit potential because a solver can then compete more effectively in the marketplace for large-scale problems.

We present a method for reducing variable dimension based upon geometry of constraints in the problem statement:

LaTeX: <pre> \begin{array}{rl} \mbox{minimize}_{x\in_{}\mathbb{R}^{^n}} & f(x) \\ \mbox{subject to} & A_{}x=b \\ & x\succeq0 \\ & x_{j\!}\in\mathbb{Z}~,\qquad j\in\mathcal{J} \end{array} </pre>

where LaTeX: \,A is a matrix of predetermined dimension, LaTeX: \mathbb{Z} represents the integers, LaTeX: \reals the real numbers, and LaTeX: \mathcal{J} is some possibly empty index set.

The caveat to use of our proposed method for presolving is that it is not fast. One would incorporate this method only when a problem is too big to be solved; that is, when solver software chronically exits with error or hangs.

Geometry of Constraints

The idea, central to our method for presolving, is more easily understood geometrically. Constraints

LaTeX: <pre> \begin{array}{l} \\ A_{}x=b \\ x\succeq0 \end{array} </pre>

suggest that a polyhedral cone is in play. Some geometers regard cones as convex Euclidean bodies that are semi-infinite in extent. In daily life, examples of finite polyhedral cones are the great Pyramids of Egypt while finite circular cones hold ice cream and block traffic. But a mathematician defines a polyhedral (semi-infinite) cone in LaTeX: \,\reals^m thus:

LaTeX: \mathcal{K}=\{A_{}x~|~x\succeq0\}
Retrieved from "http://www.convexoptimization.com/wikimization/index.php/Presolver"
Personal tools