Francesco Rinaldi

Exact Penalty Functions for Nonlinear Integer Programming Problems

Categories Integer Programming, Nonlinear Optimization Tags , ,

In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming problem can be obtained by using various exact penalty formulations of the original problem … Read more

Concave programming for minimizing the zero-norm over polyhedral sets

Categories Constrained Nonlinear Optimization, Data-Mining Tags , ,

Given a non empty polyhedral set, we consider the problem of finding a vector belonging to it and having the minimum number of nonzero components, i.e., a feasible vector with minimum zero-norm. This nonsmooth combinatorial optimization problem is NP-Hard and arises in various fields such as machine learning, pattern recognition, signal processing. We propose two … Read more