Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach

DOI10.1007/S10957-010-9653-XzbMATH Open1198.90299OpenAlexW2057612461WikidataQ57445463 ScholiaQ57445463MaRDI QIDQ604257FDOQ604257

Authors: Sumit K. Garg 

Publication date: 10 November 2010

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-010-9653-x

Recommendations

• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
• A semidefinite programming method for integer convex quadratic minimization

zbMATH Keywords

convex relaxationLagrangian relaxationquadratic integer programmingsemiunimodular congruence transformationseparable relaxation

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Integer programming (90C10)

Cites Work

• The quadratic knapsack problem -- a survey
• Matrix Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constrained global optimization: algorithms and applications
• A polyhedral branch-and-cut approach to global optimization
• Nonlinear integer programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Title not available (Why is that?)
• A polyhedral study of nonconvex quadratic programs with box constraints
• Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
• A survey for the quadratic assignment problem
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A branch and cut algorithm for hub location problems with single assignment
• Global minimization of indefinite quadratic problems
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• The nonlinear knapsack problem - algorithms and applications
• A reformulation-convexification approach for solving nonconvex quadratic programming problems
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Title not available (Why is that?)
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Constrained 0-1 quadratic programming: basic approaches and extensions
• Seizure warning algorithm based on optimization and nonlinear dynamics
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Lower bound improvement and forcing rule for quadratic binary programming
• Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
• An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
• Convex separable optimization is not much harder than linear optimization
• A polyhedral approach for nonconvex quadratic programming problems with box constraints
• Global optimization techniques for solving the general quadratic integer programming problem
• Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
• A linear programming reformulation of the standard quadratic optimization problem
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• An algorithm for global minimization of linearly constrained quadratic functions
• Polynomially solvable cases of binary quadratic programs
• A polynomial algorithm for an integer quadratic non-separable transportation problem
• Ranking in quadratic integer programming problems
• An algorithm for indefinite integer quadratic programming
• Congruence Diagonalization and Lie Groups
• Title not available (Why is that?)
• Convergent Lagrangian and domain cut method for nonlinear knapsack problems
• An enumerative algorithm framework for a class of nonlinear integer programming problems
• A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
• A new semidefinite programming bound for indefinite quadratic forms over a simplex
• A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
• Ellipsoidal approach to box-constrained quadratic problems
• A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
• Title not available (Why is that?)

Cited In (6)

• Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
• Transformation-based preprocessing for mixed-integer quadratic programs
• Set covering in fuel-considered vehicle routing problems
• A note on convex reformulation schemes for mixed integer quadratic programs
• An exact penalty function method for nonlinear mixed discrete programming problems
• Global optimization algorithm for mixed integer quadratically constrained quadratic program

Uses Software

• BARON
• CPLEX

This page was built for publication: Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604257)