scientific article; zbMATH DE number 16323

MaRDI QIDQ3972976zbMATH OpenFDO

Authors N. Z. Shor

Publication date 26 June 1992

zbMATH Keywords

nonsmooth optimizationLagrange functionnonconvex problemsmaximum stable set problemspace dilatationquadratic dual boundsscheme of decompositionsubgradient type methods

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Exact dual bounds for some nonconvex minimax quadratic optimization problems
• Dual quadratic estimates in polynomial and Boolean programming
• scientific article; zbMATH DE number 6667271
• Role of redundant constraints for improving dual bounds in polynomial optimization problems
• Duality bound method for the general quadratic programming problem with quadratic constraints

Cited in

(8)

• Dualize, split, randomize: toward fast nonsmooth optimization algorithms
• A class of problems where dual bounds beat underestimation bounds
• Dual bounds in convex and nonconvex nondifferentiable optimization problems and applications
• On duality for nonsmooth Lipschitz optimization problems
• Exact dual bounds for some nonconvex minimax quadratic optimization problems
• scientific article; zbMATH DE number 6667271 (Why is no real title available?)
• scientific article; zbMATH DE number 1159218 (Why is no real title available?)
• Dual estimates in multiextremal problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972976)