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
Refracting telescope principles. The combination of an objective lens 1 and some type of eyepiece 2 is used to gather more light than the human eye is able to collect on its own, focus it 5, and present the viewer with a brighter, clearer, and magnified virtual image 6. The objective in a refracting telescope refracts or bends light. This refraction causes parallel light rays to converge at a focal point; while those not parallel converge upon a focal plane. The telescope converts a bundle of parallel rays to make an angle α, with the optical axis to a second parallel bundle