DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-017-1203-0 / 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: QuadProgBB / 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/s11590-017-1203-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2760977299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic 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: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive 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: Decomposition methods for solving nonconvex quadratic programs via branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex reformulation for binary quadratic programming problems via average objective value maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Relaxations of Quadratically Constrained Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / 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 global optimization algorithm for polynomial programming problems using a reformulation-linearization technique / 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 generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms / 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: 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: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-017-1203-0 / rank
 
Normal rank

Latest revision as of 02:07, 10 December 2024

scientific article
Language Label Description Also known as
English
DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
scientific article

    Statements

    DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (English)
    0 references
    31 July 2018
    0 references
    quadratic program
    0 references
    difference-of-convex
    0 references
    branch-and-bound algorithm
    0 references
    global optimization
    0 references
    convex relaxation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers