Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(8 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-011-9650-0 / rank
Normal rank
 
Property / author
 
Property / author: Zhi-You Wu / rank
Normal rank
 
Property / author
 
Property / author: Guoquan Li / rank
Normal rank
 
Property / author
 
Property / author: Jing Quan / rank
Normal rank
 
Property / author
 
Property / author: Zhi-You Wu / rank
 
Normal rank
Property / author
 
Property / author: Guoquan Li / rank
 
Normal rank
Property / author
 
Property / author: Jing Quan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Outward rotations / 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-011-9650-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971586018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian smoothing heuristics for Max-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for quadratic \(0-1\) optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for indefinite integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2867346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on the unconstrained quadratic integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bound improvement and forcing rule for quadratic binary programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variable reduction technique for convex integer quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enumerative algorithm framework for a class of nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equitable dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking in quadratic integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract convexity and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization techniques for solving the general quadratic integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate algorithm for nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to analyse genetic networks and biological energy production: an introduction and contribution where OR meets biology† / rank
 
Normal rank
Property / cites work
 
Property / cites work: A provable better Branch and Bound method for a nonconvex integer quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outward rotations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-011-9650-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:54, 9 December 2024

scientific article
Language Label Description Also known as
English
Global optimality conditions and optimization methods for quadratic integer programming problems
scientific article

    Statements

    Global optimality conditions and optimization methods for quadratic integer programming problems (English)
    0 references
    15 December 2011
    0 references
    This paper establishes some sufficient and some necessary global optimality conditions for quadratic integer programming problems. The results given in this work extend results presented in [\textit{A. Beck} and \textit{M. Teboulle}, SIAM J. Optim. 11, No. 1, 179--188 (2000; Zbl 0990.90089)]; [\textit{W. Chen} and \textit{L. Zhang}, J. Glob. Optim. 46, No. 2, 191--206 (2010; Zbl 1209.90292)] and [\textit{V. Jeyakumar}, \textit{A. M. Rubinov} and \textit{Z.Y. Wu}, Math. Program. 110, No. 3, 521--541 (2007; Zbl 1206.90178)]. The authors develop a new local optimization method by exploiting the obtained necessary global optimality condition and propose a new global optimization method by combining the sufficient global optimality condition, the local optimization method and an auxiliary function. Some numerical examples are provided to illustrate the performance of both optimization methods.
    0 references
    global optimality conditions
    0 references
    quadratic integer programming problem
    0 references
    optimization method
    0 references
    auxiliary function
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers