Long-Step Path-Following Algorithm for Solving Symmetric Programming Problems with Nonlinear Objective Functions

We describe a long-step path-following algorithm for a class of symmetric programming problems with nonlinear convex objective functions. The complexity estimates similar to the case of a linear-quadratic objective function are established. The results of numerical experiments for the class of optimization problems involving quantum entropy are presented.

Citation

Preprint, University of Notre Dame, December 2017

Article

Download

View Long-Step Path-Following Algorithm for Solving Symmetric Programming Problems with Nonlinear Objective Functions