Tue, 05 May 2015

14:00 - 15:00
L3

Alternating direction methods for structured nonconvex optimization with applications in risk parity portfolio selection

Katya Scheinberg
(Lehigh University)
Abstract

We will begin by discussing the risk parity portfolio selection problem, which aims to find  portfolios for which the contributions of risk from all assets are equally weighted. The risk parity may be satisfied over either individual assets or groups of assets. We show how convex optimization techniques can find a risk parity solution in the nonnegative  orthant, however, in general cases the number of such solutions can be anywhere between zero and  exponential in the dimension. We then propose a nonconvex least-squares formulation which allows us to consider and possibly solve the general case. 

Motivated by this problem we present several alternating direction schemes for specially structured nonlinear nonconvex problems. The problem structure allows convenient 2-block variable splitting.  Our methods rely on solving convex subproblems at each iteration and converge to a local stationary point. Specifically, discuss approach  alternating directions method of multipliers and the alternating linearization method and we provide convergence rate results for both classes of methods. Moreover, global optimization techniques from polynomial optimization literature are applied to complement our local methods and to provide lower bounds.

Tue, 28 Apr 2015

14:00 - 15:00
L3

Newton-type methods for Support Vector Machines and Signal Reconstruction Problems

Kimon Fountoulakis
(University of Edinburgh)
Abstract
Support vector machines and signal reconstruction problems have initiated a resurgence of optimization methods with inexpensive iterations, namely first-order methods. The efficiency of first-order methods has been shown for several well conditioned instances. However, their practical convergence might be slow on ill-conditioned/pathological instances.
 
In this talk we will consider Newton-type methods, which aim to exploit the trade-off between inexpensive iterations and robustness. Two methods will be presented, a robust block coordinate descent method and a primal-dual Newton conjugate gradients method.  We will discuss theoretical properties of the methods and we will present numerical experiments on large scale l1-regularized logistic regression and total variation problems.
From Lawvere to Brandenburger-Keisler: Interactive forms of diagonalization and self-reference
Abramsky, S Zvesper, J Journal of Computer and System Sciences volume 81 issue 5 799-812 (01 Aug 2015)
On the universal identity in second order hydrodynamics
Grozdanov, S Starinets, A Journal of High Energy Physics volume 2015 issue 3 7 (02 Mar 2015)
Heterotic QCD axion
Buchbinder, E Constantin, A Lukas, A Physical Review D volume 91 issue 4 046010 (15 Feb 2015)
Computational techniques for reachability analysis of Max-Plus-Linear systems
Adzkiya, D De Schutter, B Abate, A Automatica volume 53 293-302 (Mar 2015)
Growth rates of the population in a branching Brownian motion with an inhomogeneous breeding potential
Berestycki, J Brunet, E Harris, J Harris, S Roberts, M Stochastic Processes and their Applications volume 125 issue 5 2096-2145 (29 Dec 2014)
Subscribe to