Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (Q1621692): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(12 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12532-018-0133-x / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QuadProgBB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVXOPT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mosek / 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: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GloMIQO / 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/s12532-018-0133-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790253958 / 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: On convex relaxations for quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / 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 cuts and matchings in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / 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: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonconvex Quadratic Programming with Box Constraints / 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: \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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: On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts / 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: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total unimodularity and the Euler-subgraph problem / 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: A reformulation-convexification approach for solving nonconvex quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / 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: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / 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: A polyhedral approach for nonconvex quadratic programming problems with box constraints / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130197918 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12532-018-0133-X / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:14, 10 December 2024

scientific article
Language Label Description Also known as
English
Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
scientific article

    Statements

    Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2018
    0 references
    nonconvex quadratic programming
    0 references
    global optimization
    0 references
    Boolean quadric polytope
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers