Penalty parameter for linearly constrained 0--1 quadratic programming

DOI10.1023/A:1022174505886MaRDI QIDQ1411397zbMATH OpenFDO

Authors D. Massart

Publication date 27 October 2003

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1022174505886

zbMATH Keywords

0-1 quadratic programmingcontinuous concave quadratic programmingglobal minimal valuepenalty parameter

Mathematics Subject Classification ID

Boolean programming (90C09) Quadratic programming (90C20)

Recommendations

• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• scientific article; zbMATH DE number 1381038
• Penalty formulation for zero-one nonlinear programming
• Penalty for zero–one integer equivalent problem
• Analysis of penalty parameters in binary constrained extremum problems

Cites work

• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• scientific article; zbMATH DE number 1302172 (Why is no real title available?)
• scientific article; zbMATH DE number 1552036 (Why is no real title available?)
• Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
• On affine scaling algorithms for nonconvex quadratic programming
• Penalty for zero–one integer equivalent problem

Cited in

(17)

• Penalty formulation for zero-one nonlinear programming
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• Improved penalty algorithm for mixed integer PDE constrained optimization problems
• A neurodynamic approach to zero-one quadratic programming
• Continuous quadratic programming formulations of optimization problems on graphs
• \texttt{EXPEDIS}: an exact penalty method over discrete sets
• A continuous approch for globally solving linearly constrained quadratic
• Penalty for zero–one integer equivalent problem
• Manifold relaxations for integer programming
• Continuous reformulations for zero-one programming problems
• scientific article; zbMATH DE number 977754 (Why is no real title available?)
• scientific article; zbMATH DE number 1381038 (Why is no real title available?)
• A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
• Analysis of penalty parameters in binary constrained extremum problems
• On distributionally robust generalized Nash games defined over the Wasserstein ball
• New results on the equivalence between zero-one programming and continuous concave programming
• Exact penalty functions for nonlinear integer programming problems

This page was built for publication: Penalty parameter for linearly constrained 0--1 quadratic programming

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