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
Lens (optics) object off the optical axis of the lens is imaged, where rays pass through the lens at an angle to the axis θ. Rays that pass through the centre of a lens of focal length "f" are focused at a point with distance from the axis. Rays passing through the outer margins of the lens are focused at different points, either further from the axis (positive coma) or closer to the axis (negative coma). In general, a bundle of parallel rays passing through the lens at a fixed distance from the centre of the lens are focused to a ring-shaped