Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints

MaRDI QIDQ2768043zbMATH OpenFDO

Authors N. Z. Shor

Publication date 10 October 2002

zbMATH Keywords

semidefinite programmingLagrange functionnondifferentiable optimizationLagrangean boundsextremal graph problemssuperfluous constraintsmaximal cut problemquadratic-type problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Recommendations

• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Lagrangian approach to quasiconvex programing
• Tight relaxations for polynomial optimization and Lagrange multiplier expressions
• Lagrangian-conic relaxations. II: Applications to polynomial optimization problems
• On Lagrangian relaxation of quadratic matrix constraints
• Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems
• New bounds for nonconvex quadratically constrained quadratic programming
• Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
• An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization
• The bounds of feasible space on constrained nonconvex quadratic programming

Cited in

(3)

• Functionally redundant constraints for Boolean quadratic-type optimization problems
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• An efficient method for obtaining sharp bounds for nonlinear boolean programming problems

This page was built for publication: Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints

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