Live briefing
Everything about Signomial
A signomial is a kind of function of one or more independent variables. It is perhaps most easily thought of as an extension of multivariable polynomials—an extension that permits exponents to be arbitrary real numbers while requiring the independent variables to be strictly positive. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: SignomialA 5-minute orientation
- Skim a recent paper: A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian networkInfluential work since 2022
- Read the landmark paper: Global optimization of signomial geometric programming problemsCited 83 times
- Go sideways: PosynomialA closely related topic
- Go sideways: Quadratic knapsack problemA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
Global optimization of signomial geometric programming problems
Relative Entropy Relaxations for Signomial Optimization
Some convexifications in global optimization of problems containing signomial terms
Global solution of optimization problems with signomial parts
Global optimization of signomial geometric programming using linear relaxation
MM algorithms for geometric and signomial programming
Global optimization for signomial discrete programming problems in engineering design
Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
🆕 Influential since 2022
A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network
Algebraic Perspectives on Signomial Optimization
Sublinear circuits and the constrained signomial nonnegativity problem
Solid-State Electroaerodynamic Aircraft Design Using Signomial Programming
Signomial Geometric Programming Approach to Solve Non-Linear Fractional Programming Problems
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Posynomial A posynomial, also known as a posinomial in some literature, is a function of the form f ( x 1 , x 2 , … , x n ) = ∑ k = 1 K c k x 1 a 1 k ⋯ x n a n k…
- Quadratic knapsack problem The quadratic knapsack problem (QKP), first introduced in 19th century, is an extension of knapsack problem that allows for quadratic terms in the objective…
- Positive polynomial In mathematics, a positive polynomial (respectively non-negative polynomial) on a particular set is a polynomial whose values are positive (respectively…
- Constrained optimization In mathematical optimization, constrained optimization (in some contexts called constraint optimization) is the process of optimizing an objective function…
- Quadratic programming Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…
- Quadratic unconstrained binary optimization Quadratic unconstrained binary optimization (QUBO), also known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem…