Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-010-9639-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034063035 / 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: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds / 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: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems / 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

Latest revision as of 18:36, 4 July 2024

scientific article
Language Label Description Also known as
English
Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
scientific article

    Statements

    Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (English)
    0 references
    0 references
    0 references
    15 December 2011
    0 references
    0 references
    polynomial programs
    0 references
    reformulation-linearization technique (RLT)
    0 references
    grid-factor constraints
    0 references
    factorable programs
    0 references
    BARON
    0 references
    cutting planes
    0 references
    valid inequalities
    0 references
    global optimization
    0 references
    0 references
    0 references
    0 references