Conic Optimization - Definition

Definition

Given a real vector space X, a convex, real-valued function

defined on a convex cone, and an affine subspace defined by a set of affine constraints, a conic optimization problem is to find the point in for which the number is smallest. Examples of include the positive semidefinite matrices, the positive orthant for, and the second-order cone . Often is a linear function, in which case the conic optimization problem reduces to a semidefinite program, a linear program, and a second order cone program, respectively.

Read more about this topic:  Conic Optimization

Famous quotes containing the word definition:

    “Was man made stupid to see his own stupidity?
    Is God by definition indifferent, beyond us all?
    Is the eternal truth man’s fighting soul
    Wherein the Beast ravens in its own avidity?”
    —Richard Eberhart (b. 1904)

    “... if, as women, we accept a philosophy of history that asserts that women are by definition assimilated into the male universal, that we can understand our past through a male lens—if we are unaware that women even have a history—we live our lives similarly unanchored, drifting in response to a veering wind of myth and bias.”
    —Adrienne Rich (b. 1929)

    “No man, not even a doctor, ever gives any other definition of what a nurse should be than this—”devoted and obedient.” This definition would do just as well for a porter. It might even do for a horse. It would not do for a policeman.”
    —Florence Nightingale (1820–1910)