# Overview of sageopt¶

Sageopt includes functionality for optimization and checking nonnegativity of signomials and polynomials. The conceptual components here are:

Some classes representing signomials and polynomials, as well as domains to which these functions are restricted.

A high-level modeling interface (called “coniclifts”) for convex optimization problems. This interface includes native primal and dual “SAGE constraints.”

Sageopt then takes these two components, and defines various functions to reduce user’s barrier to entry in working with SAGE relaxations.

Our main concern is to make it easier to get started with *optimization*.
SAGE relaxations for optimization have different “primal” and “dual” forms, and it would take a bit of
expertise to implement the advanced dual-form relaxations from scratch.
The documentation below will bring you up to speed on the basics of sageopt’s signomial
and polynomial optimization features, as well as the most crucial prerequisites.

At some point, users will need to interact with sageopt’s “coniclifts” backend. This is especially true if you intend to use sageopt mostly for certifying function nonnegativity. Documentation for coniclifts is given below.