Convex Optimization

← Back to Domain-Specific Abstractions by Domain

2 domain-specific abstractions whose origin domain is Convex Optimization.

• Linear matrix inequality — A convex constraint requiring an affine combination of symmetric or Hermitian matrices to be positive semidefinite.
• Proximal operator — The operator mapping a point to the unique minimizer of a function plus one-half the squared distance to that point, under standard proper lower-semicontinuous convex assumptions.