con la presente chiedo che vengano diffusi mediante la lista random gli avvisi relativi a tre seminari che il prof. Nicolae Popovici (Department of Mathematics - Faculty of Mathematics and Computer Science - Babes-Bolyai University – Cluj-Napoca, Romania) terrà presso il Dipartimento di Economia dell'Insubria.
Si allegano anche le locandine.
Grazie mille
cordiali saluti
enrico moretto
***
Seminar announcement: Nicolae Popovici on a general local-global extremality principle in vector optimization
On February 13th, 2019, 15.00-16.00, Prof. Nicolae Popovici (Department of Mathematics - Faculty of Mathematics and Computer Science - Babes-Bolyai University – Cluj-Napoca, Romania) will give a talk on “A general local-global extremality principle in vector optimization” (joint with Ovidiu Bagdasar, University of Derby, UK)
Abstract It is known that any local minimal point of a semistrictly quasiconvex real-valued function is a global minimal point; also, any local maximal point of an explicitly quasiconvex real-valued function is a global minimal point, provided that it belongs to the intrinsic core of the function's domain. We have shown that these local min - global min and local max - global min type properties can be extended and unified by a general local-global extremality principle for generalized convex vector-valued functions with respect to two proper subsets of the outcome space.
Keywords: unified vector optimization; generalize convex functions.
Seminar announcement: Nicolae Popovici on new algorithms for solving discrete vector optimization problems
On February 14th, 2019, 15.00-16.00, Prof. Nicolae Popovici (Department of Mathematics - Faculty of Mathematics and Computer Science - Babes-Bolyai University – Cluj-Napoca, Romania) will give a talk on “New algorithms for solving discrete vector optimization problems” (joint with Christian Guenther, Martin-Luther University of Halle-Wittenberg, Germany)
Abstract We present some new Graef-Younes type algorithms for solving discrete vector optimization problems. In order to determine all minimal elements of a finite set with respect to an ordering cone, the original approach proposed by Jahn in 2006 (known as the Jahn-Graef-Younes method) consists of a forward iteration (Graef-Younes method), followed by a backward iteration. Our methods involve additional sorting procedures based on scalar cone-monotone functions.
Keywords: discrete vector optimization; cone-monotone scalarization functions. Seminar announcement: Nicolae Popovici on a new algorithm for solving planar multiobjective location problems involving the Manhattan norm
On February 15th, 2019, 11.00-12.00, Prof. Nicolae Popovici (Department of Mathematics - Faculty of Mathematics and Computer Science - Babes-Bolyai University – Cluj-Napoca, Romania) will give a talk on “New algorithms for solving discrete vector optimization problems” (joint with Shabagh Alzorba, Christian Guenther and Christiane Tammer, Martin-Luther University of Halle-Wittenberg, Germany)
Abstract We study unconstrained planar multiobjective location problems, where distances between points are defined by means of the Manhattan norm. By eliminating the nonessential objectives we develop an effective algorithm for generating the whole set of efficient solutions as the union of a special family of rectangles and line segments.
Keywords: location problems; Fermat-Weber type problems; Matlab algorithms.