Interior-point methods for unconstrained geometric programming and scaling problems

08/27/2020
by   Peter Bürgisser, et al.
0

We provide a condition-based analysis of two interior-point methods for unconstrained geometric programs, a class of convex programs that arise naturally in applications including matrix scaling, matrix balancing, and entropy maximization. Our condition numbers are natural geometric quantities associated with the Newton polytope of the geometric program, and lead to diameter bounds on approximate minimizers. We also provide effective bounds on the condition numbers both in general and under combinatorial assumptions on the Newton polytope. In this way, we generalize the iteration complexity of recent interior-point methods for matrix scaling and matrix balancing. Recently, there has been much work on algorithms for certain optimization problems on Lie groups, known as capacity and scaling problems. For commutative groups, these problems reduce to unconstrained geometric programs, which serves as a particular source of motivation for our work.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2021

Barriers for recent methods in geodesic optimization

We study a class of optimization problems including matrix scaling, matr...
research
04/05/2019

Spectral analysis of matrix scaling and operator scaling

We present a spectral analysis for matrix scaling and operator scaling. ...
research
08/28/2023

Minimizing Quasi-Self-Concordant Functions by Gradient Regularization of Newton Method

We study the composite convex optimization problems with a Quasi-Self-Co...
research
07/10/2023

Invex Programs: First Order Algorithms and Their Convergence

Invex programs are a special kind of non-convex problems which attain gl...
research
12/10/2018

Disciplined Geometric Programming

We introduce log-log convex programs, which are optimization problems wi...
research
09/02/2022

Optimal Diagonal Preconditioning: Theory and Practice

Preconditioning has been a staple technique in optimization and machine ...
research
02/21/2018

Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming

Semidefinite programming can be considered over any real closed field, i...

Please sign up or login with your details

Forgot password? Click here to reset