Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 04:42, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach	scientific article

Statements

scholarly article

0 references

Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (English)

0 references

0 references

Journal of Optimization Theory and Applications

0 references

publication date

10 November 2010

0 references

zbMATH Keywords

quadratic integer programming

0 references

separable relaxation

0 references

semiunimodular congruence transformation

0 references

Lagrangian relaxation

0 references

convex relaxation

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10957-010-9653-x

0 references

0 references

A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization

0 references

A polynomial algorithm for an integer quadratic non-separable transportation problem

0 references

Polynomially Solvable Cases of Binary Quadratic Programs

0 references

Computational aspects of a branch and bound algorithm for quadratic zero- one programming

0 references

Lower bound improvement and forcing rule for quadratic binary programming

0 references

Seizure warning algorithm based on optimization and nonlinear dynamics

0 references

Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures

0 references

Constrained 0-1 quadratic programming: basic approaches and extensions

0 references

Nonlinear integer programming

0 references

A survey for the quadratic assignment problem

0 references

0 references

The quadratic knapsack problem -- a survey

0 references

The nonlinear knapsack problem - algorithms and applications

0 references

A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem

0 references

Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

0 references

Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function

0 references

OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION

0 references

A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals

0 references

An algorithm for indefinite integer quadratic programming

0 references

Global optimization techniques for solving the general quadratic integer programming problem

0 references

Ranking in quadratic integer programming problems

0 references

An enumerative algorithm framework for a class of nonlinear integer programming problems

0 references

Solving a class of linearly constrained indefinite quadratic problems by DC algorithms

0 references

An algorithm for global minimization of linearly constrained quadratic functions

0 references

0 references

Global minimization of indefinite quadratic problems

0 references

Constrained global optimization: algorithms and applications

0 references

0 references

Global minimization of large-scale constrained concave quadratic problems by separable programming

0 references

A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems

0 references

An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions

0 references

A reformulation-convexification approach for solving nonconvex quadratic programming problems

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems

0 references

Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming

0 references

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound

0 references

Ellipsoidal approach to box-constrained quadratic problems

0 references

A linear programming reformulation of the standard quadratic optimization problem

0 references

A new semidefinite programming bound for indefinite quadratic forms over a simplex

0 references

A branch and cut algorithm for hub location problems with single assignment

0 references

A polyhedral study of nonconvex quadratic programs with box constraints

0 references

A polyhedral approach for nonconvex quadratic programming problems with box constraints

0 references

0 references

Convex separable optimization is not much harder than linear optimization

0 references

Convergent Lagrangian and domain cut method for nonlinear knapsack problems

0 references

0 references

Matrix Analysis

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

0 references

A polyhedral branch-and-cut approach to global optimization

0 references

Congruence Diagonalization and Lie Groups

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

10.1007/S10957-010-9653-X

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:604257

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q604257&oldid=38165805"