Augmented Lagrangian algorithm addresses optimal solutions in mixed-integer nonlinear problems, suggesting efficient outcomes.
In this paper, we consider mixed-integer nonlinear constrained optimization problems. Specifically, we assume that the integrality constraints are non-relaxable, that is, the functions appearing in the problem cannot be computed when the integrality constraints are violated. To solve this class of problems, we propose an augmented Lagrangian-type algorithm which is able to handle integer variables by means of primitive directions. A theoretical analysis of the convergence properties of the proposed algorithm is carried out. Finally, some numerical experimentation is reported.
No takes yet. Share an insight, caveat, or question.
Cristofari et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: