Frontiers 97
http://frontiers.ir
enA SQP method for minimization of locally Lipschitz functions with nonlinear constraints
http://frontiers.ir/node/134
<div class="field field-name-body field-type-text-with-summary field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p><strong>Abstract</strong></p>
<p>In this paper, we present a quadratic model for minimizing problems with nonconvex and nonsmooth objective and constraint functions. This method is based on sequential quadratic programming<br />
that uses an l1 penalty function to equilibrate among the decrease<br />
of the objective function and the feasibility of the constraints. To<br />
construct a quadratic subproblem, we linearize the objective and constraint functions with their </p></div></div></div>Thu, 12 Jul 2018 06:43:01 +0000Ssh134 at http://frontiers.irhttp://frontiers.ir/node/134#commentsOn the Dimension of Unimodular Discrete Spaces
http://frontiers.ir/node/133
<div class="field field-name-body field-type-text-with-summary field-label-hidden"><div class="field-items"><div class="field-item even" property="content:encoded"><p><strong>Abstract</strong>: This talk is focused on large scale properties of infinite graphs and discrete subsets of the Euclidean space. We present two new notions of dimension, namely the unimodular Minkowski and Hausdorff dimensions, which are inspired by the classical Minkowski and Hausdorff dimensions. These dimensions are defined for unimodular discrete spaces, which are defined in this work as a class of random discrete metric spaces with a distinguished point called the origin. These spaces provide a common generalization to stationary point processes (under their Palm version) and unimodular random rooted graphs.</p>
<p>The concept of unimodularity, developed for graphs in the last two decades, can be interpreted as statistical homogeneity. Unimodular graphs appear in many contexts, such as graph limits, Cayley graphs, transitive graphs with a unimodular automorphism group, and stationary point processes.</p>
<p>If one wants to cover an infinite discrete space by large balls, infinitely many balls are needed anyway. The main novelty is the use of unimodularity in the definitions where it suggests replacing the infinite sums regarding the coverings by the expectation of certain random variables at the origin. Other related notions such as volume growth are also discussed, which provide tools to calculate the dimension. Several examples will be discussed in relation with the theory of point processes, unimodular graphs and self-similarity. Different methods for finding upper bounds and lower bounds on the dimension will also be presented and illustrated through the examples.</p>
<p>This work is a joint work with Francois Baccelli and Mir-Omid Haji-Mirsadeghi.</p>
<p><a href="https://www.researchgate.net/profile/Ali_Khezeli">Ali Khezeli</a></p>
</div></div></div>Thu, 12 Jul 2018 06:37:59 +0000Ssh133 at http://frontiers.irhttp://frontiers.ir/node/133#commentsShort Course
http://frontiers.ir/node/110
<div class="field field-name-field-speaker field-type-text field-label-above"><div class="field-label">Speaker(s): </div><div class="field-items"><div class="field-item even">Farzad Aryan, University of Montreal </div></div></div><div class="field field-name-field-title field-type-text field-label-above"><div class="field-label">Title: </div><div class="field-items"><div class="field-item even">Topics in analytic number theory</div></div></div><div class="field field-name-field-abstract field-type-text-long field-label-above"><div class="field-label">Abstract: </div><div class="field-items"><div class="field-item even"><p><strong>We will discuss some of the main results in the theory of the zeta function and sieve methods as well as some recent developments in the field of analytic number theory. </strong></p>
</div></div></div><div class="field field-name-field-image-satellite field-type-image field-label-hidden"><div class="field-items"><div class="field-item even"><a href="http://frontiers.ir/sites/default/files/arian.jpg"><img typeof="foaf:Image" src="http://frontiers.ir/sites/default/files/styles/large/public/arian.jpg?itok=FKRnsmY-" width="371" height="480" alt="" /></a></div></div></div>Sun, 24 Jun 2018 09:01:43 +0000shokri110 at http://frontiers.irhttp://frontiers.ir/node/110#commentsShort Course
http://frontiers.ir/node/90
<div class="field field-name-field-speaker field-type-text field-label-above"><div class="field-label">Speaker(s): </div><div class="field-items"><div class="field-item even">Alireza Salehi Golsefidi UCSD </div></div></div><div class="field field-name-field-title field-type-text field-label-above"><div class="field-label">Title: </div><div class="field-items"><div class="field-item even">Random walk in compact groups</div></div></div><div class="field field-name-field-abstract field-type-text-long field-label-above"><div class="field-label">Abstract: </div><div class="field-items"><div class="field-item even"><p>My short course will be on the same subject of my conference talk, and the main ideas behind the proof will be presented. I will try to make the presentation useful for advance undergrad students that they might not be familiar with in the abstract and title.</p>
</div></div></div><div class="field field-name-field-image-satellite field-type-image field-label-hidden"><div class="field-items"><div class="field-item even"><a href="http://frontiers.ir/sites/default/files/salehi.jpg"><img typeof="foaf:Image" src="http://frontiers.ir/sites/default/files/styles/large/public/salehi.jpg?itok=p-8ZQrKu" width="371" height="480" alt="" /></a></div></div></div>Tue, 26 Jul 2016 20:47:24 +0000saeed90 at http://frontiers.irhttp://frontiers.ir/node/90#comments