Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (Q1029700): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
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: SeDuMi / 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/s10898-008-9372-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105880662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / 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: Q4352739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / 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 reformulation-convexification approach for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of semidefinite programming for sensor network localization / 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: Global Optimization in Geometry — Circle Packing into the Square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of semidefinite programming. Theory, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 18:22, 1 July 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
scientific article

    Statements

    Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming (English)
    0 references
    13 July 2009
    0 references
    0 references
    0 references

    Identifiers