Penalty parameter for linearly constrained 0--1 quadratic programming
From MaRDI portal
Publication:1411397
DOI10.1023/A:1022174505886zbMath1030.90059MaRDI QIDQ1411397
Publication date: 27 October 2003
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
0-1 quadratic programmingpenalty parametercontinuous concave quadratic programmingglobal minimal value
Related Items
New results on the equivalence between zero-one programming and continuous concave programming, Continuous quadratic programming formulations of optimization problems on graphs, Improved penalty algorithm for mixed integer PDE constrained optimization problems, A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, Manifold relaxations for integer programming, Continuous reformulations for zero-one programming problems, A new penalty parameter for linearly constrained 0--1 quadratic programming problems, A neurodynamic approach to zero-one quadratic programming, Exact penalty functions for nonlinear integer programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- On affine scaling algorithms for nonconvex quadratic programming
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Penalty for zero–one integer equivalent problem
