Signomial and polynomial optimization via relative entropy and partial dualization (Q823883): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GPkit / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2955472196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalty treatment of equality constraints in generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductor design using signomial programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconvex Optimization for Communication Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming using linear relaxation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic global optimization algorithm for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rectangle branch-and-pruning approach for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust algorithm for generalized geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some retarded difference inequalities of product form and their application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of signomial geometric programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Class of global minimum bounds of polynomial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Entropy Relaxations for Signomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amoebas, nonnegative polynomials and sums of squares supported on circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forms derived from the arithmetic-geometric inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and NP_R-completeness of certain fewnomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global injectivity and multiple equilibria in uni- and bi-molecular reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework of SAGE and SONC polynomials and its duality theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials that are positive on an interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Polynomial and Semi-Algebraic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4308910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disciplined geometric programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for range computation of polynomials using the Bernstein form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bounded degree SOS hierarchy for polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of generalized geometric programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization / rank
 
Normal rank

Latest revision as of 13:18, 27 July 2024

scientific article
Language Label Description Also known as
English
Signomial and polynomial optimization via relative entropy and partial dualization
scientific article

    Statements

    Signomial and polynomial optimization via relative entropy and partial dualization (English)
    0 references
    0 references
    0 references
    0 references
    16 December 2021
    0 references
    global optimization
    0 references
    exponential cone programs
    0 references
    SAGE certificates
    0 references
    SOS certificates
    0 references
    signomial programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references