Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
type: Item
instance of: scholarly article
title: Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
zbMATH Open document ID: 1079.90093
author: Ivo Nowak
published in: Mathematical Programming. Series A. Series B
publication date: 2005-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2159475
zbMATH Keywords: semidefinite programming
zbMATH Keywords: quadratic programming
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: non-convex programming
zbMATH Keywords: decomposition
describes a project that uses: LaGO
describes a project that uses: EISPACK
describes a project that uses: NOA
describes a project that uses: GLOPT
describes a project that uses: ARPACK
describes a project that uses: MINLPLib
MaRDI profile type: Publication
full work available at URL: s10107-003-0500-9
OpenAlex ID: W1989771738
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: A relaxation method for nonconvex quadratically constrained quadratic programs
cites work: Q5688505
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: MIP: Theory and practice -- closing the gap
cites work: MINLPLib -- a collection of test models for mixed-integer nonlinear programming
cites work: A Decomposition Method for Quadratic Zero-One Programming
cites work: Q4023809
cites work: Decomposition Principle for Linear Programs
cites work: Linear Control of a Markov Production System
cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
cites work: Dual bounding procedures lead to convergent branch-and-bound algorithms
cites work: Partitioning mathematical programs for parallel solution
cites work: Bilinear programming and structured stochastic games
cites work: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
cites work: Q4198056
cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Q4273942
cites work: Introduction to global optimization
cites work: Quadratically constrained quadratic programming: Some applications and a method for solution
cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
cites work: A geometric study of dual gaps, with applications
cites work: Q4517108
cites work: Dual bounds and optimality cuts for all-quadratic programs with convex constraints
cites work: Global Optimization and Constraint Satisfaction
cites work: Q4428719
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: A semidefinite framework for trust region subproblems with applications to large scale minimization
cites work: Decomposition methods in stochastic programming
cites work: Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations
cites work: Duality bound method for the general quadratic programming problem with quadratic constraints
cites work: A Cutting Plane Approach for Chance Constrained Linear Programs
DOI: 10.1007/S10107-003-0500-9
description: scientific article; zbMATH DE number 2159475