Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
type: Item
instance of: scholarly article
title: Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
zbMATH Open document ID: 1198.90299
author: Sumit K. Garg
published in: Journal of Optimization Theory and Applications
publication date: 2010-11-10T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5814301
zbMATH Keywords: quadratic integer programming
zbMATH Keywords: separable relaxation
zbMATH Keywords: semiunimodular congruence transformation
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: convex relaxation
describes a project that uses: BARON
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10957-010-9653-x
OpenAlex ID: W2057612461
Wikidata QID: Q57445463
cites work: Q4198056
cites work: A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization
cites work: A polynomial algorithm for an integer quadratic non-separable transportation problem
cites work: Polynomially Solvable Cases of Binary Quadratic Programs
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Lower bound improvement and forcing rule for quadratic binary programming
cites work: Seizure warning algorithm based on optimization and nonlinear dynamics
cites work: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
cites work: Constrained 0-1 quadratic programming: basic approaches and extensions
cites work: Nonlinear integer programming
cites work: A survey for the quadratic assignment problem
cites work: Q4321546
cites work: The quadratic knapsack problem -- a survey
cites work: The nonlinear knapsack problem - algorithms and applications
cites work: A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
cites work: Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
cites work: Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
cites work: OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
cites work: A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
cites work: An algorithm for indefinite integer quadratic programming
cites work: Global optimization techniques for solving the general quadratic integer programming problem
cites work: Ranking in quadratic integer programming problems
cites work: An enumerative algorithm framework for a class of nonlinear integer programming problems
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: An algorithm for global minimization of linearly constrained quadratic functions
cites work: Q4833806
cites work: Global minimization of indefinite quadratic problems
cites work: Constrained global optimization: algorithms and applications
cites work: Q3491318
cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming
cites work: A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
cites work: Ellipsoidal approach to box-constrained quadratic problems
cites work: A linear programming reformulation of the standard quadratic optimization problem
cites work: A new semidefinite programming bound for indefinite quadratic forms over a simplex
cites work: A branch and cut algorithm for hub location problems with single assignment
cites work: A polyhedral study of nonconvex quadratic programs with box constraints
cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints
cites work: Q3818127
cites work: Convex separable optimization is not much harder than linear optimization
cites work: Convergent Lagrangian and domain cut method for nonlinear knapsack problems
cites work: Q4040221
cites work: Matrix Analysis
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Q4040299
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: Congruence Diagonalization and Lie Groups
DOI: 10.1007/S10957-010-9653-X
description: scientific article; zbMATH DE number 5814301