Convex Optimization on Functionals of Probability Densities

02/16/2020
by   Tomohiro Nishiyama, et al.
0

In information theory, some optimization problems result in convex optimization problems on strictly convex functionals of probability densities. In this note, we study these problems and show conditions of minimizers and the uniqueness of the minimizer if there exist a minimizer.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2021

Comparing different subgradient methods for solving convex optimization problems with functional constraints

We provide a dual subgradient method and a primal-dual subgradient metho...
research
01/04/2020

Minimization Problems on Strictly Convex Divergences

The divergence minimization problem plays an important role in various f...
research
03/05/2020

Convex Optimization Over Risk-Neutral Probabilities

We consider a collection of derivatives that depend on the price of an u...
research
10/19/2020

Nearly sharp structured sketching for constrained optimization

In this work, we study a tensor-structured random sketching matrix to pr...
research
09/10/2022

Optimization of the fluid model of scheduling: local predictions

In this research a continuous model for resource allocations in a queuin...
research
06/30/2023

Convex Optimization in Legged Robots

Convex optimization is crucial in controlling legged robots, where stabi...
research
03/30/2020

An adaptive finite element approach for lifted branched transport problems

We consider so-called branched transport and variants thereof in two spa...

Please sign up or login with your details

Forgot password? Click here to reset