Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(11 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-011-9425-z / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6087670 / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial programs
Property / zbMATH Keywords: polynomial programs / rank
 
Normal rank
Property / zbMATH Keywords
 
reformulation-linearization technique
Property / zbMATH Keywords: reformulation-linearization technique / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite programming
Property / zbMATH Keywords: semidefinite programming / rank
 
Normal rank
Property / zbMATH Keywords
 
BARON
Property / zbMATH Keywords: BARON / rank
 
Normal rank
Property / zbMATH Keywords
 
GloptiPoly
Property / zbMATH Keywords: GloptiPoly / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite cuts
Property / zbMATH Keywords: semidefinite cuts / rank
 
Normal rank
Property / zbMATH Keywords
 
global optimization
Property / zbMATH Keywords: global optimization / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BARON / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloptiPoly / rank
 
Normal rank
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/s10589-011-9425-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027109023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality for the CDT Subproblem: A Necessary and Sufficient Condition / 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: Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of test problems in local and global optimization / 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: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of successive SDP relaxation methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane algorithms for nonlinear semi-definite programming problems with applications / 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: An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs / 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: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More test examples for nonlinear programming codes / 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: 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: A reformulation-convexification approach for solving nonconvex quadratic programming problems / 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: Nondifferentiable optimization and polynomial problems / 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: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-011-9425-Z / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts
scientific article

    Statements

    Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (English)
    0 references
    0 references
    0 references
    0 references
    27 September 2012
    0 references
    polynomial programs
    0 references
    reformulation-linearization technique
    0 references
    semidefinite programming
    0 references
    BARON
    0 references
    GloptiPoly
    0 references
    semidefinite cuts
    0 references
    global optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers