In this work, we deal with Truncated Newton methods for solving large scale (possibly nonconvex) unconstrained optimization problems. In particular,we consider the use of amodified Bunch and Kaufman factorization for solving the Newton equation, at each (outer) iteration of the method. The Bunch...
Nonlinear Optimization
-
-
In this paper we propose the use of damped techniques within Nonlinear Conjugate Gradient (NCG) methods. Damped techniques were introduced by Powell and recently reproposed by Al-Baali and till now, only applied in the framework of quasi--Newton methods. We extend their use to NCG methods in large...
-
Starting from the paper by Nash and Sofer (1990), we propose a heuristic adaptive truncation criterionfor the inner iterations within linesearch-based truncated Newton methods. Our aim is to possibly avoid ‘‘over-solving’’ of the Newton equation, based on a comparison between the predicted...
-
In this paper, mixed-integer nonsmooth constrained optimization problems are considered, where objective/constraint functions are available only as the output of a black-box zeroth-order oracle that does not provide derivative information. A new derivative-free linesearch-based algorithmic...
-
This paper deals with the problem of cruise itinerary planning which plays a central role in worldwide cruise ship tourism. In particular, the Day-by-day Cruise Itinerary Optimization (DCIO) problem is considered. Assuming that a cruise has been planned in terms of homeports and journey duration,...
-
The l(1)-ball is a nicely structured feasible set that is widely used in many fields (e.g., machine learning, statistics and signal analysis) to enforce some sparsity in the model solutions. In this paper, we devise an active-set strategy for efficiently dealing with minimization problems over the...
-
La Prof.ssa Dolores Romero Morales è visiting Professor presso il DIAG dal 1 al 31 maggio 2022.
Where: Aula Magna DIAG & online su piattaforma Meet
When: May 6, 2022 - 15:00
...
-
In this paper we consider Quadratic Programming (QP) problems with general linear constraints. We show, through a computational investigation, that a careful selection of a suitable reformulation of such problems, together with the related relaxation, and an intensive application of bound...
-
In this paper we address game theory problems arising in the context of network security. In traditional game theory problems, given a defender and an attacker, one searches for mixed strategies which minimize a linear payoff functional. In the problems addressed in this paper an additional...
-