Segnalo anche su questa lista l'evento sociale della conferenza AIRO:
http://www.airo.org/conferences/airo2015/e-sport
Si tratta di un torneo informale di un videogioco open source che si
svolgerà al museo degli strumenti per il calcolo la sera dell'8 settembre.
"The competition is open to all the conference participants, the
accompanying persons, the organizers, any of their relative, friend and
acquaintance (recursively), and whomever can claim any relationship with
the conference, …
[View More]however tenuous and imaginative it may be.
Fabulous final prices, and gadgets for all participants!"
L'evento è collegato alla conferenza dell'AIRO (associazione italiana
ricerca operativa) che si svolgerà la prossima settimana al dipartimento
di informatica http://www.airo.org/conferences/airo2015/program. Per chi
è interessato all'algebra lineare numerica segnalo in particolare il
minisimposio "Numerical Methods for Complex Networks", in cui parleranno
Francesca Arrigo, Dario Fasino e Caterina Fenu.
-federico
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel:+39-050-2213143
[View Less]
Two seminars in optimization, one after the other, are taking place next
Tuesday.
Speaker1: Fabian Flores-Bazan (University of Concepcion)
Title1: Strong duality in nonconvex optimization with a single equality
and geometric constraints: applications to QP
Time1: Tuesday, June 30; 15:00
Place1: Sala seminari est, informatica
Speaker2: Marco Locatelli (Università di Parma)
Title2: Some results about convex envelopes
Time2: Tuesday, June 30; 15:45
Place2: Sala seminari est, informatica
…
[View More]Abstract1: The validity of strong duality for a non convex optimization
problem under a single equality and geometric constraints is
characterized in a topological and geometric manner. In particular, a
hidden convexity of the conic hull of joint-range of the pair of
functions associated to the original problem, is obtained. Applications
to derive KKT conditions without standard constraints qualification are
also discussed. Several examples showing our results provide much more
information than those appearing elsewhere, are given. Furthermore,
first and second order optimality condition, for a non convex quadratic
optimization problem under two quadratic equality constraints, are also
presented. Finally, the standard quadratic problem involving a non
necessarily polyhedral cone is analyzed in detail.
The talk is based on joints works with G. Carcamo and F. Opazo.
Abstract2: In this talk we discuss convex envelopes for some bivariate
functions over general polytopes and for some $n$-dimensional quadratic
functions over the unit simplex.
We first give two formulations of convex envelope, a primal and a dual
one. Next, we discuss how to derive the convex envelope for some
bivariate functions over polytopes, provided that some given assumptions
are fulfilled.
It will turn out that the formula of the convex envelope can be derived
through the solution of a parametric convex program or, equivalently,
through the solution of the corresponding KKT system.
For what concerns the $n$-dimensional quadratic functions over the unit
simplex, we will first associate a graph to the quadratic function, and
next we will show that the derivation of the convex envelope is related
to the identification of the spanning forests over this graph.
===
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel. +39 050 2213143
[View Less]
Ricevo e inoltro questa offerta di lavoro.
-federico
-------- Forwarded Message --------
in Zanichelli cercano un data analyst junior a tempo determinato, e
una parte della selezione (quella "tecnica") la faccio io. In allegato
c'è la call: potreste girarla, per favore, a chiunque possa essere
interessato?
Gli interessati possono inviare cv e lettera di presentazione al
nevio.dubbini(a)gmail.com.
(NB il mio indirizzo email non c'è nella call allegata, quindi
andrebbe comunicato nel testo …
[View More]dell'email).
Grazie,
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Nevio Dubbini
mail: nevio.dubbini(a)gmail.com
web: sites.google.com/site/neviodubbini
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
[View Less]
In the framework of the research project "Mathematical models and
computational methods for complex networks" by the University of Pisa,
Paola Boito (Faculté des Sciences et Techniques Université de Limoges)
will give three seminars on
"Complex networks, functions of matrices and quadrature rules".
The abstract is provided below. The seminars will take place in June
at the Department of Computer Science of the University of Pisa:
-- June 8th, 15:00-16:00, sala seminari est (room 351);…
[View More]
-- June 10th, 10:00-11:00, sala seminari est (room 351);
-- June 11th, 15:00-16:00, sala seminari est (room 351).
Abstract.
One cornerstone of our modern society is the use of different kinds of
networks.
Our cities are connected by a network of streets and railways,
telecommunication networks including
their wireless, mobile components, the internet, and the World Wide Web
build the most important infrastructure
for communication and information worldwide. Designing and managing such
networks pose challenging algorithmic and numerical problems.
These three talks are concerned with the development, analysis and
application of numerical linear algebra tools for the quantitative
study of important properties of large-scale complex networks, such as
centrality, betweenness and communicability measures.
Specifically, we design efficient algorithms for the fast approximation
of the entries of matrix functions such as the
exponential and the resolvent of adjacency matrices and graph
Laplacians, as well as their traces. While these matrices
are quite sparse, in the case of complex networks they behave very
differently from the matrices associated with regular lattices (grids),
such as those arising from discretizations of partial differential
equations. Hence, there is a need to develop new methods,
both computational and analytical, to deal with these very large-scale
problems. Potential applications include the analysis of
social networks, the study of biological and neurological networks,
applications in physics and operations research, and so forth.
[View Less]
Speaker: Nick Vannieuwenhoven (KU Leuven)
Title: Towards a perturbation theory for the tensor rank decomposition
Date: Thursday, 4 June 2015.
Time: 11:00
Place: Sala Seminari Ovest, dipartimento di informatica
Abstract: The tensor rank decomposition is a decomposition of a tensor
into a linear combination of rank-1 tensors. One of the key advantages
of higher-order tensors is that this decomposition is generally unique,
which allows for an interpretation of the individual rank-1 terms.
…
[View More]Because of this property, the tensor rank decomposition has found
application in several domains. For instance, they can be used as a
clustering algorithm in an unsupervised learning setting assuming a
certain statistical model wherein each of the rank-1 tensors in the
decomposition will correspond with a cluster. In the applications where
tensor rank decompositions arise, the tensor is usually known only up to
some small perturbation error. This raises the following interesting
problem: Suppose that the tensor is perturbed by a small quantity, by
how much can the individual rank-1 terms change relative to the
magnitude of the perturbation? Can it be unbounded? In this
presentation, I will explore the definition of a possible condition
number that answers these questions up to first order.
==
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel:+39-050-2213143
[View Less]
Date: Thursday May 14, 2015
Time: 11:00
Place: Sala Seminari Ovest, dipartimento di informatica
Speaker: Francesco Romani, dipartimento di informatica, U Pisa.
Title: *Krylov subspace methods for the solution of linear systems*
Abstract: Krylov subspace methods are iterative methods for the solution
of linear systems which operate by multiplying the system matrix
(sometimes also its transpose) by a vector. They are recommended when
the system matrix is large and sparse or with a strong …
[View More]structure. The
most common Krylov subspace methods are presented focusing the
attention mainly on the practical and empirical aspects.
==
The seminar will be in Italian (but with slides in English).
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel:+39-050-2213143
[View Less]
Date: Thursday May 14, 2015
Time: 11:00
Place: Sala Seminari Ovest, dipartimento di informatica
Speaker: Francesco Romani, dipartimento di informatica, U Pisa.
Title: *Krylov subspace methods for the solution of linear systems*
Abstract: Krylov subspace methods are iterative methods for the solution
of linear systems which operate by multiplying the system matrix
(sometimes also its transpose) by a vector. They are recommended when
the system matrix is large and sparse or with a strong …
[View More]structure. The
most common Krylov subspace methods are presented focusing the
attention mainly on the practical and empirical aspects.
==
The seminar will be in Italian (but with slides in English).
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel:+39-050-2213143
[View Less]
Our next seminar is tomorrow morning.
Date: Thursday April 30, 2015
Time: 10:00
Place: Sala Seminari Ovest, dipartimento di informatica
Speaker: Maria Grazia Scutellà, dipartimento di informatica, U Pisa.
Title: *Optimizing Green Wireless LANs*
Abstract: We consider problems arising in the design of Green (or
energy-saving) Wireless Local Area Networks (GWLANs). In this context,
decisions on powering-on a set of access points, and decisions on the
assignment of the user terminals to the …
[View More]opened access points, have to be
taken simultaneously. In particular, the level of power assigned to each
access point may affect, in a nonlinear way, the capacity of the
connections between the access points and the user terminals that are
assigned to them. The aim is to minimize the overall power consumption
of the access points, which is given by a linear dependency between the
power consumed and the total demand assigned to the access points, via
assignment costs.
In the first part of the talk we present a Mixed Integer formulation
with NonLinear constraints (MINLP) and an optimization approach,
belonging to the framework of Branch and Benders Cut methods, which is
based on the proposed MINLP formulation. In a non-standard fashion, the
master problem of the approach includes the variables of the Benders
subproblem, but relaxes their integrality. The approach has been tested
on a large set of instances, and compared to a more traditional Benders
decomposition algorithm on a subset of instances without the assignment
costs, where the two approaches can be compared. The main achievements
of the computational experimentation are shortly discussed.
Then, in the second part of the talk, we address the optimization of
GWLANs in a more realistic scenario, which takes into account also some
uncertainty factors. Specifically, we present a robust optimization
approach that incorporates both link capacity fluctuations and user
mobility under Bertsimas and Sim's robust optimization paradigm. Again,
preliminary computational results are shortly discussed.
===
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel. +39 050 2213143
[View Less]
Date: Thursday April 30, 2015
Time: 10:00
Place: Sala Seminari Ovest, dipartimento di informatica
Speaker: Maria Grazia Scutellà, dipartimento di informatica, U Pisa.
Title: *Optimizing Green Wireless LANs*
Abstract: We consider problems arising in the design of Green (or
energy-saving) Wireless Local Area Networks (GWLANs). In this context,
decisions on powering-on a set of access points, and decisions on the
assignment of the user terminals to the opened access points, have to be
taken …
[View More]simultaneously. In particular, the level of power assigned to each
access point may affect, in a nonlinear way, the capacity of the
connections between the access points and the user terminals that are
assigned to them. The aim is to minimize the overall power consumption
of the access points, which is given by a linear dependency between the
power consumed and the total demand assigned to the access points, via
assignment costs.
In the first part of the talk we present a Mixed Integer formulation
with NonLinear constraints (MINLP) and an optimization approach,
belonging to the framework of Branch and Benders Cut methods, which is
based on the proposed MINLP formulation. In a non-standard fashion, the
master problem of the approach includes the variables of the Benders
subproblem, but relaxes their integrality. The approach has been tested
on a large set of instances, and compared to a more traditional Benders
decomposition algorithm on a subset of instances without the assignment
costs, where the two approaches can be compared. The main achievements
of the computational experimentation are shortly discussed.
Then, in the second part of the talk, we address the optimization of
GWLANs in a more realistic scenario, which takes into account also some
uncertainty factors. Specifically, we present a robust optimization
approach that incorporates both link capacity fluctuations and user
mobility under Bertsimas and Sim's robust optimization paradigm. Again,
preliminary computational results are shortly discussed.
===
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel. +39 050 2213143
[View Less]
Date: Thursday April 16, 2015
Time: 11:00
Place: Sala Riunioni Est, dipartimento di informatica
Speaker: Federico Poloni, dipartimento di informatica, U Pisa.
Title: *Methods for accurate invariant subspace computations.*
Abstract: We consider two modelling problems, one arising in control
theory (linear-quadratic regulator) and one arising in the modelling of
queues (or buffers) under a continuous-time Markov model. The solution
of both can be reduced to finding the invariant subspace of …
[View More]a suitable
structured matrix, or equivalently solving a Riccati-like matrix equation.
I will present linear algebra tools that can be used to solve them
accurately; in particular:
* a QR-like matrix factorization in which a tall skinny n x m matrix is
factored as U*R, where R is m x m square invertible and U has a m x m
identity submatrix and all its other entries bounded in modulus by 1.
This factorization can be formulated as an optimization problem (maximum
volume submatrix) or as finding a suitable set of basic variables in a
tableau.
* (if time allows) a numerical method for the Markov problem based on a
technique (GTH method) to solve linear systems with a (possibly
ill-conditioned) M-matrix without subtractions, obtaining high accuracy
in both large and small entries of the solution.
===
Everyone is welcome!
--
--federico poloni
Dipartimento di Informatica, Università di Pisa
http://www.di.unipi.it/~fpoloni/ tel. +39 050 2213143
[View Less]