Analysis of penalty parameters in binary constrained extremum problems

DOI10.11650/TJM.18.2014.3349zbMATH Open1357.90091OpenAlexW2043868877MaRDI QIDQ514709FDOQ514709

Authors: Carla Antoni, Mario Pedrazzoli 

Publication date: 9 March 2017

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm.18.2014.3349

Recommendations

• Penalty parameter for linearly constrained 0--1 quadratic programming
• On reducibility of the general convex programming problem to an unconditional extremum problem
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems
• Penalty for zero–one integer equivalent problem

zbMATH Keywords

penalty functionexact penaltyrelaxed problempenalty parameterpenalty problem

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Penalty for zero–one integer equivalent problem
• On the equivalence, via relaxation-penalization, between vector generalized systems

Cited In (4)

• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• Penalty parameter for linearly constrained 0--1 quadratic programming
• On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation
• A smoothing method for zero--one constrained extremum problems

This page was built for publication: Analysis of penalty parameters in binary constrained extremum problems

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