JuMP logoJuMP logo
    • Introduction
    • Should you use JuMP?
    • Installation Guide
      • Introduction
      • Getting started with Julia
      • Getting started with JuMP
      • Getting started with sets and indexing
      • Getting started with data and plotting
      • Debugging
      • Design patterns for larger models
      • Performance tips
      • Introduction
      • The knapsack problem example
      • The diet problem
      • The cannery problem
      • The factory schedule example
      • The multi-commodity flow problem
      • The network multi-commodity flow problem
      • Tips and tricks
      • The facility location problem
      • Financial modeling problems
      • Geographical clustering
      • Network flow problems
      • The transportation problem
      • Multi-objective knapsack
      • Simple multi-objective examples
      • Sudoku
      • N-Queens
      • Constraint programming
      • Callbacks
      • Sensitivity analysis of a linear program
      • Computing the duals of a mixed-integer program
      • Introduction
      • Simple examples
      • Portfolio optimization
      • Rocket Control
      • Optimal control for a Space Shuttle reentry trajectory
      • Tips and tricks
      • User-defined Hessians
      • Nested optimization problems
      • Computing Hessians
      • Mixed complementarity problems
      • Introduction
      • Primal and dual warm-starts
      • Tips and Tricks
      • Simple semidefinite programming examples
      • Dualization
      • Arbitrary precision arithmetic
      • Logistic regression
      • Experiment design
      • Minimal ellipses
      • Ellipsoid approximation
      • Quantum state discrimination
      • Benders decomposition
      • Column generation
      • Traveling Salesperson Problem
      • Parallelism
      • Power Systems
      • Optimal power flow
      • Serving web apps
      • Two-stage stochastic programs
    • Models
    • Variables
    • Constraints
    • Expressions
    • Objectives
    • Containers
    • Solutions
    • Solver-independent Callbacks
    • Complex number support
    • Nonlinear Modeling
    • Nonlinear Modeling (Legacy)
    • JuMP
    • JuMP.Containers
    • Algebraic modeling languages
    • Contributing
    • Extensions
    • Custom binaries
    • Style Guide
    • Roadmap
    • Checklists
    • Introduction
    • jump-dev/AmplNLWriter.jl
    • jump-dev/BARON.jl
    • jump-dev/CPLEX.jl
    • jump-dev/CSDP.jl
    • jump-dev/Cbc.jl
    • jump-dev/Clp.jl
    • jump-dev/Dualization.jl
    • jump-dev/ECOS.jl
    • jump-dev/GLPK.jl
    • jump-dev/Gurobi.jl
    • jump-dev/HiGHS.jl
    • jump-dev/Ipopt.jl
    • jump-dev/KNITRO.jl
    • jump-dev/MiniZinc.jl
    • jump-dev/MosekTools.jl
    • jump-dev/MultiObjectiveAlgorithms.jl
    • jump-dev/Pajarito.jl
    • jump-dev/Pavito.jl
    • jump-dev/SCS.jl
    • jump-dev/SDPA.jl
    • jump-dev/SDPNAL.jl
    • jump-dev/SDPT3.jl
    • jump-dev/SeDuMi.jl
    • jump-dev/Xpress.jl
    • COPT-Public/COPT.jl
    • GAMS-dev/GAMS.jl
    • JuliaOpt/NLopt.jl
    • JuliaPolyhedra/CDDLib.jl
    • MadNLP/MadNLP.jl
    • chkwon/PATHSolver.jl
    • chriscoey/Hypatia.jl
    • darnstrom/DAQP.jl
    • ds4dm/Tulip.jl
    • kocvara/Loraine.jl
    • lanl-ansi/Alpine.jl
    • lanl-ansi/Juniper.jl
    • mariohsouto/ProxSDP.jl
    • odow/NEOSServer.jl
    • osqp/OSQP.jl
    • oxfordcontrol/CDCS.jl
    • oxfordcontrol/COSMO.jl
    • oxfordcontrol/Clarabel.jl
    • scipopt/SCIP.jl
    • Introduction
    • jump-dev/DiffOpt.jl
    • jump-dev/ParametricOptInterface.jl
    • jump-dev/PolyJuMP.jl
      • License
      • Installation
      • Documentation
    • jump-dev/SumOfSquares.jl
    • infiniteopt/InfiniteOpt.jl
    • joaquimg/BilevelJuMP.jl
    • odow/SDDP.jl
    • plasmo-dev/Plasmo.jl
    • rafaqz/DimensionalData.jl
      • Introduction
      • Motivation
      • Solving a problem using MathOptInterface
      • Implementing a solver interface
      • Transitioning from MathProgBase
      • Implementing a constraint bridge
      • Manipulating expressions
      • Latency
      • Standard form problem
      • Models
      • Variables
      • Constraints
      • Solutions
      • Problem modification
      • Duality
      • Infeasibility certificates
      • Naming conventions
      • Standard form
      • Models
      • Variables
      • Constraints
      • Modifications
      • Nonlinear programming
      • Callbacks
      • Errors
        • Overview
        • API Reference
        • Overview
        • List of bridges
        • API Reference
        • Overview
        • API Reference
        • Overview
        • API Reference
        • Overview
        • API Reference
        • Overview
        • API Reference
      • Checklists
    • Release notes
  • Release notes
Version
  • Extensions
  • jump-dev/PolyJuMP.jl
  • jump-dev/PolyJuMP.jl
GitHub

PolyJuMP.jl

Build Status codecov

PolyJuMP.jl is a JuMP extension for formulating and solving polynomial optimization problems.

These problems can then be solved using SumOfSquares.jl.

License

PolyJuMP.jl is licensed under the MIT license.

Installation

Install PolyJuMP using Pkg.add:

import Pkg
Pkg.add("PolyJuMP")

Documentation

Documentation for PolyJuMP.jl is included in the documentation for SumOfSquares.jl.

« jump-dev/ParametricOptInterface.jljump-dev/SumOfSquares.jl »

Powered by Documenter.jl and the Julia Programming Language.

Settings


This document was generated with Documenter.jl version 0.28.0-DEV on Friday 15 September 2023. Using Julia version 1.9.3.