Phd thesis in algorithms


Main navigation

G. Kiss. Theory and algorithms for truncated hierarchical B-splines.

Stella, Lorenzo Proximal envelopes: Smooth optimization algorithms for nonsmooth problems. Advisor: Patrinos, Prof Panagiotis.


  1. PhD Thesis Defense: Measuring the Impact of Algorithms in Online Marketplaces.
  2. Files in this item.
  3. ap psychology essay on schizophrenia.
  4. Mathematical Algorithmic Optimization - Otto-von-Guericke-University Magdeburg;
  5. teen pregnancy research paper?
  6. dissertation acknowledgements undergraduate?
  7. This item appears in the following Collection(s)!

Coadvisor: Bemporad, Prof. Nonsmooth optimization problems arise in an ever-growing number of applications in science and engineering. Proximal or splitting algorithms are a general approach to a variety of nonsmooth problems, but as with all first order methods their convergence properties are severely affected by ill conditioning of the problem.

In this thesis, an interpretation to proximal algorithms as unconstrained gradient methods over an associated function function is provided. Such functions are called proximal envelopes, in analogy with the well-known Moreau envelope.

Divide and Conquer Algorithms by Elijah Ben Izzy [PWL NYC]

Proximal envelopes provide a link between nonsmooth and smooth optimization, and allow for the application of more efficient and robust smooth optimization algorithms to the solution of nonsmooth, possibly constrained problems. Next, he will investigate Amazon Marketplace and inspect two major and correlated algorithmic components that determine the product prices consumers need to pay: the Buy Box and dynamic pricing by third-party sellers.

Finally, he will study the relationship between gender and rank in search results output by resume search engines on major hiring markets. Using statistical tests and regression analysis, Le will find statistically significant ranking bias and gender effects on all three websites, to the detriment of female candidates.

Motivated by these findings, he will propose two alternative ranking methods that encode different definitions of fairness, and examine the inherent tradeoffs posed by trying to achieve fairness in hiring markets. His thesis topic is investigating fairness, personalization, and economic practice of online pricing algorithms. April 24, pm - pm EDT. Details Date: April 24, Time: pm - pm. Boston , MA United States.

Location Campus Boston.

phd thesis in algorithms Phd thesis in algorithms
phd thesis in algorithms Phd thesis in algorithms
phd thesis in algorithms Phd thesis in algorithms
phd thesis in algorithms Phd thesis in algorithms
phd thesis in algorithms Phd thesis in algorithms
phd thesis in algorithms Phd thesis in algorithms
phd thesis in algorithms Phd thesis in algorithms

Related phd thesis in algorithms



Copyright 2019 - All Right Reserved