Tag Archives: Optimisation

Interchangeability of infimum in risk measures

In this post we discuss the interchangeability of the infimum with (monotone) risk measures in finite probability spaces. In particular, we show that under the common monotonicity assumption (which is satisfied by all well-behaving risk measures), for a risk measure \rho:\mathbb{R}^n\to\mathbb{R} and a mapping f:\mathbb{R}^m\to\mathbb{R}^n, we have

\begin{aligned} \rho\left(\inf_x f(x)\right) = \inf_x \rho(f(x)) \end{aligned}

and \mathbf{argmin}_x f(x) \subseteq \mathbf{argmin}_x \rho(f(x)), while, under additional conditions (which are typically met in finite-dimensional spaces), we have \mathbf{argmin}_x f(x) = \mathbf{argmin}_x \rho(f(x)) Continue reading →

Cone programs and self-dual embeddings

This post aims at providing some intuition into cone programs from different perspectives; in particular:

  1. Equivalence of different formulations of cone programs
  2. Fenchel duality
  3. Primal-dual optimality conditions (OC)
  4. OCs as variational inequalities
  5. Homogeneous self-dual embeddings (HSDEs)
  6. OCs for HSDEs

Continue reading →

Projection on epigraph via a proximal operator

A while ago I posted this article on how to project on the epigraph of a convex function where I derived the optimality conditions and the KKT conditions. This post comes as an addendum proving a third way to project on an epigraph. Do read the previous article first because I use the same notation here. Continue reading →

Lagrange vs Fenchel Duality

In this post we discuss the correspondence between the Lagrangian and the Fenchelian duality frameworks and we trace their common origin to the concept of convex conjugate functions and perturbed optimization problems. Continue reading →

Metric subregularity for monotone inclusions

Metric sub-regularity is a local property of set-valued operators which turns out to be a key enabler for linear convergence in several operator-based algorithms. However, conditions are often stated for the fixed-point residual operator and become rather difficult to verify in practice. In this post we state sufficient metric sub-regularity conditions for a monotone inclusion which are easier to verify and we focus on the preconditioned proximal point method (P3M). Continue reading →

Let us learn Russian

Давайте выучим русский язык

Almost Originality

a mathematical journal

Annoying Precision

"A good stock of examples, as large as possible, is indispensable for a thorough understanding of any concept, and when I want to learn something new, I make it my first job to build one." - Paul Halmos

Alex Sisto

Alessandro Sisto's math blog

Journey into Randomness

random stuffs, mainly related to randomness

Society Of Mathematics

Make Mathematics Great Again

What's new

Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Tao

Normal Deviate

Thoughts on Statistics and Machine Learning

Research and Lecture notes

by Fabrice Baudoin

mathbabe

Exploring and venting about quantitative issues

Look at the corners!

The math blog of Dmitry Ostrovsky

The Unapologetic Mathematician

Mathematics for the interested outsider

Almost Sure

A random mathematical blog

Mathematix

Mathematix is the mathematician of Erquy - the village of Asterix

Design a site like this with WordPress.com
Get started