Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-012-0024-z / rank
Normal rank
 
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / 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: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity embedded in nonconvex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex envelope formula for multilinear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced RLT representations for nonconvex polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing RLT relaxations via a new class of semidefinite cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex factorable programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual quadratic estimates in polynomial and Boolean programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral branch-and-cut approach to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-012-0024-Z / rank
 
Normal rank

Latest revision as of 16:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
scientific article

    Statements

    Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (English)
    0 references
    0 references
    0 references
    9 December 2013
    0 references
    reformulation-linearization technique (RLT)
    0 references
    filtering strategies
    0 references
    polynomial programming
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers