Optimization

The catalogue's first page explains what each entry shows.

Chapter 1 · Introduction all chapters

  • Result

    A function is concave on a set exactly when its pointwise negative is convex there.

    Lean statement
    theorem concavityDefinition : concavityDefinitionTarget

    concavityDefinition

  • Result

    A quadratic form with a symmetric positive-semidefinite matrix is convex.

    Lean statement
    theorem psdQuadraticConvex : psdQuadraticConvexTarget

    psdQuadraticConvex

  • Result

    Every finite-dimensional Euclidean unit ball is convex.

    Lean statement
    theorem euclideanUnitBallConvex : euclideanUnitBallConvexTargetV2

    euclideanUnitBallConvex

  • Result

    Every finite-dimensional affine scalar function is convex.

    Lean statement
    theorem linearFunctionConvex : linearFunctionConvexTarget

    linearFunctionConvex

  • Result

    Maximizing a function is minimizing its pointwise negative.

    Lean statement
    theorem maxAsMin : maxAsMinTarget

    maxAsMin

  • Result

    Sets cut out by linear equalities and inequalities are convex.

    Lean statement
    theorem polyhedronConvex : polyhedronConvexTarget

    polyhedronConvex

  • Result

    The convex-program classification uses the objective, equality, and inequality conditions on their respective declared domains.

    Lean statement
    theorem convexProgramDefinition : convexProgramDefinitionTargetV4

    convexProgramDefinition

  • Result

    The set-based and explicit presentations of the transportation minimum agree.

    Lean statement
    theorem transportation13 : transportation13Target

    transportation13

  • Result

    The source's defining finite-domain condition for discrete optimization.

    Lean statement
    theorem discreteDomainDefinition : discreteDomainDefinitionTargetV2

    discreteDomainDefinition

  • Result

    The source's line-segment definition agrees with Convex.

    Lean statement
    theorem convexSetDefinition : convexSetDefinitionTarget

    convexSetDefinition

  • Equation (1.1)

    The explicit feasibility-and-comparison form of the constrained minimum (1.1).

    Lean statement
    theorem formulation11 : formulation11Target

    formulation11

  • Equation (1.2)

    The constrained problem (1.2) has a feasible global solution.

    Lean statement
    theorem example12HasSolution : example12HasSolutionTargetV2

    example12HasSolution

  • Equation (1.4)

    Equation (1.4) agrees with ConvexOn on a convex domain.

    Lean statement
    theorem convexFunction14 : convexFunction14Target

    convexFunction14 · 1 more declaration under this item