Convex optimization linear programming. Many optimization problems can be reformulated as convex minimization problems. For example, the problem of "maximizing" a "concave function" formula_1 can be re-formulated equivalently as a problem of minimizing the convex function formula_2. An optimization problem, which aims to find a point formula_3 such that formula_4 for all formula_5 in some feasible set formula_6, is convex if and only if formula_6 and the objective function formula_1 satisfy the following two properties: Perhaps more conveniently, the convex problem can be phrased in the more shorthand general definition of optimization: finding some formula_19 such that for some feasible set formula_6
Telecentric lens Telecentric lens A telecentric lens is a compound lens that has its entrance or exit pupil at infinity; in the prior case, this produces an orthographic view of the subject. This means that the chief rays (oblique rays that pass through the center of the aperture stop) are parallel to the optical axis in front of or behind the system, respectively. The simplest way to make a lens telecentric is to put the aperture stop at one of the lens's focal points. An entrance pupil at infinity makes the lens object-space telecentric. Such lenses are used in machine vision systems