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
Parallel projection Parallel projection A parallel projection is a projection of an object in three-dimensional space onto a fixed plane, known as the "projection plane" or "image plane", where the "rays", known as "lines of sight" or "projection lines", are parallel to each other. It is a basic tool in descriptive geometry. The projection is called "orthographic" if the rays are perpendicular (orthogonal) to the image plane, and "oblique" or "skew" if they are not. A parallel projection is a particular case of "projection" in mathematics and "graphical projection" in technical drawing. Parallel projections can be seen as the limit of a