Method of obtaining estimates in quadratic extremal problems with Boolean variables

DOI10.1007/BF01072102zbMath0593.90052MaRDI QIDQ3724090

A. S. Davydov, Naum Z. Shor

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

Lagrange multipliersnonsmooth optimizationestimatesmethod of ellipsoidssubgradient algorithm with space dilatation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (5)

On N. Z. Shor's three scientific ideas ⋮ Class of global minimum bounds of polynomial functions ⋮ An approach to obtaining global extremums in polynomial mathematical programming problems ⋮ Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection ⋮ Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
• Family of algorithms for solving convex programming problems

This page was built for publication: Method of obtaining estimates in quadratic extremal problems with Boolean variables