FMSL SEMINAR SERIES
Tuesday, March 24th 2015
1:00pm
ACE Room, 4.16 Tonsley Building
A/Prof. Adil Bagirov,
Faculty of Science and Technology,
Federation University Australia
DP Programming: Optimality Conditions and Numerical Methods
In this talk, I discuss optimization problems where the objective function is represented as
a difference of two convex polyhedral (convex piecewise linear) (DP) functions. First we
consider unconstrained minimization of such functions, formulate necessary and sufficient
conditions for local and global optimality. Then we extend these results to problems on
minimization of DP functions subject to linear equalities and inequalities.
We present
numerical algorithms for finding both local and global solutions to the DP programming
problems.
•
Adil Bagirov received a master degree in Applied Mathematics from Baku State University,
Azerbaijan in 1983, and the Candidate of Sciences degree in Mathematical Cybernetics from
the Institute of Cybernetics of Azerbaijan National Academy of Sciences in 1989 and PhD
degree in Optimization from Federation University Australia (formerly the University of
Ballarat), Ballarat, Australia in 2002. He worked at the Space Research Institute (Baku,
Azerbaijan), Baku State University (Baku, Azerbaijan), Joint Institute for Nuclear Research
(Moscow, Russia). Dr. Bagirov is with Federation University Australia (Ballarat, Australia)
since 1999. He currently holds the Associate Professor position at this university. He has
won four Australian Research Council Discovery and Linkage grants to conduct research in
nonsmooth and global optimization and their applications. His main research interests are
in the area of nonsmooth and global optimization and their applications in data mining,
regression analysis and water management. Dr. Bagirov has published one book, more than
one hundred journal papers, book chapters and papers in conference proceedings.
1