We present an approximation algorithm for network revenue management problems. In our approximation algorithm, we construct an approximate policy using value function approximations that are expressed as linear combinations of basis functions. We use a backward recursion to compute the coefficients of the basis functions in the linear combinatio...
Creator:
Topaloglu, Huseyin (Cornell University)
Created:
2018-10-04
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
The inverse photolithography problem is a key step in the production of integrated circuits. I propose a regularization and computation strategy for this optimization problem, whose key feature is a regularization procedure for a suitable thresholding operation. The validity of the method is shown by a convergence analysis and by numerical exper...
Creator:
Rondi, Luca (Università di Trieste)
Created:
2016-12-14
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
The Steiner polynomial of a solid body in R^d is of degree d and describes the volume as a function of the thickening parameter (parallel body). There are d+1 coefficients which are used to define the d+1 intrinsic volumes of the solid body. In d=2 dimensions, the first intrinsic volume is the length, and in d=3 dimensions, it is the total mean ...
Creator:
Edelsbrunner, Herbert (Institute of Science and Technology Austria (IST))
Created:
2014-03-04
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
The approximation error approach was proposed in [J. Kaipio \& E. Somersalo, Statistical and Computational Inverse Problems, Springer, 2004] for handling modelling errors due to model reduction and unknown nuisance parameters in inverse problems. In this talk, we discuss the application of the approximation error approach for approximate margina...
Creator:
Kolehmainen, Ville (University of Eastern Finland)
Created:
2017-09-07
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
Approximation of positive polynomials by sums of squares has importantapplications to polynomial optimisation. In this talk, I will surveythe main recent results achieved on that topic:I will consider positive (respectively, non-negative) polynomials oncompact (respectively, unbounded) semi-algebraic sets. I will discussrepresentations in the as...
Creator:
Kuhlmann, Salma (University of Saskatchewan)
Created:
2007-01-20
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
In an approach similar to Ewald's method for evaluating lattice sums, we split the application of Helmholtz Green's functions between the spatial and the Fourier domains and, for any finite accuracy, approximate their kernels.In the spatial domain we use a near optimal linear combination of decaying Gaussians with positive coefficients and, in t...
Creator:
Beylkin, Gregory (University of Colorado)
Created:
2010-08-04
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.
If A is a finite-dimensional algebra with automorphism group G, then varieties of generating r-tuples of elements in A, considered up to G-action, produce a sequence of varieties B(r) approximating the classifying space BG. I will explain how this construction generalizes certain well-known examples such as Grassmannians and configuration spaces...
Creator:
Williams, Ben (University of British Columbia)
Created:
2022-08-05
Contributed By:
University of Minnesota, Institute for Mathematics and its Applications.