Lagrangian bounds in multiextremal polynomial and discrete optimization problems

DOI10.1023/A:1014004625997zbMath1009.90084OpenAlexW1545882088MaRDI QIDQ1598884

Petro I. Stetsyuk, Naum Z. Shor

Publication date: 28 May 2002

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014004625997

zbMATH Keywords

eigenvaluesnondifferentiable optimizationsymmetric matricesdiscrete optimization problems on graphslagrangian boundsquadratic type problemssuperfluous constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonsmooth analysis (49J52) Combinatorial optimization (90C27)

Related Items (10)

Functionally redundant constraints for Boolean quadratic-type optimization problems ⋮ On N. Z. Shor's three scientific ideas ⋮ A method to solve conditional optimization problems with quadratic objective functions on the set of permutations ⋮ Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations ⋮ Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program ⋮ Theory and software implementations of Shor's \(r\)-algorithms ⋮ On solving nonconvex optimization problems by reducing the duality gap ⋮ \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization ⋮ Unnamed Item ⋮ Strong duality for general quadratic programs with quadratic equality constraints

This page was built for publication: Lagrangian bounds in multiextremal polynomial and discrete optimization problems