RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: \(\alpha BB\): A global optimization method for general constrained nonconvex problems / 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: On convex relaxations for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality / 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: Semidefinite Programming vs. LP Relaxations for Polynomial 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: Q5292090 / 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: A branch-and-reduce approach to global optimization / 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: A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions / 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: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / 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 / cites work
 
Property / cites work: Global optimization of general nonconvex problems with intermediate polynomial substructures / rank
 
Normal rank

Revision as of 22:11, 12 July 2024

scientific article
Language Label Description Also known as
English
RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
scientific article

    Statements

    RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (English)
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    reformulation-linearization technique (RLT)
    0 references
    open-source code
    0 references
    constraint filtering strategies
    0 references
    valid inequalities
    0 references
    reduced RLT representations
    0 references
    polynomial programming
    0 references
    numerical example
    0 references
    nonconvex optimization
    0 references
    comparison of software packages
    0 references
    algorithm
    0 references
    filtering
    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
    0 references