Abstract
We consider a primal-dual potential reduction algorithm for nonlinear convex optimization problems over symmetric cones. The same complexity estimates as in the case of the linear objective function are obtained provided a certain nonlinear system of equations can be solved with a given accuracy. This generalizes the result of K. Kortanek, F. Potra and Y. Ye [7]. We further introduce a generalized Nesterov–Todd direction and show how it can be used to achieve a required accuracy (by solving the linearization of above mentioned nonlinear system) for a class of nonlinear convex functions satisfying scaling Lipschitz condition. This result is a far-reaching generalization of results of F. Potra, Y. Ye and J. Zhu [8], [9]. Finally, we show that a class of functions (which contains quantum entropy function) satisfies scaling Lipschitz condition.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
