Convex optimization descent, and nonsmooth filter methods. Solving even close-to-convex but non-convex problems can be computationally intractable. Minimizing a unimodal function is intractable, regardless of the smoothness of the function, according to results of Ivanov. Conventionally, the definition of the convex optimization problem (we recall) requires that the objective function "f" to be "minimized" and the feasible set be convex. In the special case of linear programming (LP), the objective function is both concave and convex, and so LP can also consider the problem of maximizing an objective function without confusion. However, for most convex minimization problems, the objective function is not
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