Dual estimates in multiextremal problems

DOI10.1007/BF00122430zbMath0765.90072MaRDI QIDQ1201906

Naum Z. Shor

Publication date: 17 January 1993

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

zbMATH Keywords

nonsmooth optimizationdecompositionnondifferentiable optimizationpolynomial functionsadditional constraintsdual estimatesnonconvex multiextremal problems

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ Some directions and results of research in mathematical programming and system analysis ⋮ On subspace properties of the quadratically constrained quadratic program ⋮ Hilbert's 17th problem and best dual bounds in quadratic minimization ⋮ The MIN-cut and vertex separator problem ⋮ Global optimization for sum of generalized fractional functions ⋮ Computation of the distance to semi-algebraic sets ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Mathematical properties of optimization problems defined by positively homogeneous functions ⋮ Modified \(r\)-algorithm to find the global minimum of polynomial functions ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)

Cites Work

• Unnamed Item
• Constrained global optimization: algorithms and applications
• On the Shannon capacity of a graph

This page was built for publication: Dual estimates in multiextremal problems