scientific article; zbMATH DE number 16323
zbMATH Open0738.90073MaRDI QIDQ3972976FDOQ3972976
Authors: N. Z. Shor 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
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
nonsmooth optimizationLagrange functionnonconvex problemsmaximum stable set problemspace dilatationquadratic dual boundsscheme of decompositionsubgradient type methods
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)
Cited In (8)
- Title not available (Why is that?)
- Dual estimates in multiextremal problems
- Exact dual bounds for some nonconvex minimax quadratic optimization problems
- 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
- Title not available (Why is that?)
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms
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)
