Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
From MaRDI portal
Publication:604257
DOI10.1007/S10957-010-9653-XzbMath1198.90299OpenAlexW2057612461WikidataQ57445463 ScholiaQ57445463MaRDI QIDQ604257
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
Lagrangian relaxationconvex relaxationquadratic integer programmingsemiunimodular congruence transformationseparable relaxation
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (6)
Transformation-based preprocessing for mixed-integer quadratic programs ⋮ An exact penalty function method for nonlinear mixed discrete programming problems ⋮ Set covering in fuel-considered vehicle routing problems ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ A note on convex reformulation schemes for mixed integer quadratic programs ⋮ Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A survey for the quadratic assignment problem
- A linear programming reformulation of the standard quadratic optimization problem
- The quadratic knapsack problem -- a survey
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- A polynomial algorithm for an integer quadratic non-separable transportation problem
- A polyhedral approach for nonconvex quadratic programming problems with box constraints
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Ranking in quadratic integer programming 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
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Global optimization techniques for solving the general quadratic integer programming problem
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Ellipsoidal approach to box-constrained quadratic problems
- An algorithm for global minimization of linearly constrained quadratic functions
- The nonlinear knapsack problem - algorithms and applications
- Seizure warning algorithm based on optimization and nonlinear dynamics
- A branch and cut algorithm for hub location problems with single assignment
- A polyhedral study of nonconvex quadratic programs with box constraints
- A polyhedral branch-and-cut approach to global optimization
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Constrained 0-1 quadratic programming: basic approaches and extensions
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Nonlinear integer programming
- Lower bound improvement and forcing rule for quadratic binary programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An algorithm for indefinite integer quadratic programming
- Polynomially Solvable Cases of Binary Quadratic Programs
- Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
- Matrix Analysis
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Congruence Diagonalization and Lie Groups
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Convex separable optimization is not much harder than linear optimization
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
This page was built for publication: Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
