# Accelerated first-order methods for hyperbolic programming

Full Length Paper Series A

First Online:

- 233 Downloads

## Abstract

We develop a framework for applying accelerated methods to general hyperbolic programming, including linear, second-order cone, and semidefinite programming as special cases. The approach replaces a hyperbolic program with a convex optimization problem whose smooth objective function is explicit, and for which the only constraints are linear equations (one more linear equation than for the original problem). Virtually any first-order method can be applied. An iteration bound for a representative accelerated method is derived.

## Keywords

Hyperbolic programming Accelerated first-order methods Convex optimization## Mathematics Subject Classification

90C25 90C22## References

- 1.Bauschke, H.H., Guler, O., Lewis, A.S., Sendov, H.S.: Hyperbolic polynomials and convex analysis. Can. J. Math.
**53**(3), 470–488 (2001)MathSciNetzbMATHGoogle Scholar - 2.Beck, A., Teboulle, M.: Smoothing and first order methods: a unified framework. SIAM J. Optim.
**22**(2), 557–580 (2012)MathSciNetzbMATHGoogle Scholar - 3.Becker, S., Bobin, J., Candès, E.J.: Nesta: a fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci.
**4**(1), 1–39 (2011)MathSciNetzbMATHGoogle Scholar - 4.Becker, S.R., Candès, E.J., Grant, M.C.: Templates for convex cone problems with applications to sparse signal recovery. Math. Program. Comput.
**3**(3), 165–218 (2011)MathSciNetzbMATHGoogle Scholar - 5.Foucart, S., Rauhut, H.: A Mathematical Introduction to Compressive Sensing. Springer, London (2013)zbMATHGoogle Scholar
- 6.Freund, R.M., Lu, H.: New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure. arXiv preprint arXiv:1511.02974 (2015)
- 7.Garding, L.: An inequality for hyperbolic polynomials. J. Math. Mech.
**8**(6), 957–965 (1959)MathSciNetGoogle Scholar - 8.Güler, O.: Hyperbolic polynomials and interior point methods for convex programming. Math. Oper. Res.
**22**(2), 350–377 (1997)MathSciNetzbMATHGoogle Scholar - 9.Hanselka, C.: Definite determinantal representations of ternary hyperbolic forms. arXiv preprint arXiv:1411.1661 (2014)
- 10.Helton, J.W., Vinnikov, V.: Linear matrix inequality representation of sets. Commun. Pure Appl. Math.
**60**(5), 654–674 (2007)MathSciNetzbMATHGoogle Scholar - 11.Lan, G.: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization. Math. Program.
**149**(1–2), 1–45 (2015)MathSciNetzbMATHGoogle Scholar - 12.Lan, G., Zhaosong, L., Monteiro, R.D.C.: Primal-dual first-order methods with \( {O}(1/ \epsilon ) \) iteration-complexity for cone programming. Math. Program.
**126**(1), 1–29 (2011)MathSciNetzbMATHGoogle Scholar - 13.Lewis, A., Parrilo, P., Ramana, M.: The Lax conjecture is true. Proc. Am. Math. Soc.
**133**(9), 2495–2499 (2005)MathSciNetzbMATHGoogle Scholar - 14.Lu, Z., Nemirovski, A., Monteiro, R.D.C.: Large-scale semidefinite programming via a saddle point mirror-prox algorithm. Math. Program.
**109**(2–3), 211–237 (2007)MathSciNetzbMATHGoogle Scholar - 15.Malgrange, B., Narasimhan, R.: Lectures on the Theory of Functions of Several Complex Variables. Springer, Berlin (1984)Google Scholar
- 16.Nemirovski, A., Yudin, D.: Problem Complexity and Method Efficiency in Optimization (1983)Google Scholar
- 17.Nesterov, Y.: Universal gradient methods for convex optimization problems. Math. Program.
**152**(1–2), 381–404 (2015)MathSciNetzbMATHGoogle Scholar - 18.Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Berlin (2004)zbMATHGoogle Scholar
- 19.Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program.
**103**(1), 127–152 (2005)MathSciNetzbMATHGoogle Scholar - 20.Nesterov, Y.: Smoothing technique and its applications in semidefinite optimization. Math. Program.
**110**(2), 245–259 (2007)MathSciNetzbMATHGoogle Scholar - 21.Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program.
**140**(1), 125–161 (2013)MathSciNetzbMATHGoogle Scholar - 22.Nesterov, Y., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia (1994)Google Scholar
- 23.Renegar, J.: Hyperbolic programs, and their derivative relaxations. Found. Comput. Math.
**6**(1), 59–79 (2006)MathSciNetzbMATHGoogle Scholar - 24.Renegar, J.: Efficient first-order methods for linear programming and semidefinite programming. arXiv preprint arXiv:1409.5832 (2014)
- 25.Renegar, J.: “Efficient” subgradient methods for general convex optimization. SIAM J. Optim.
**26**(4), 2649–2676 (2016)MathSciNetzbMATHGoogle Scholar - 26.Renegar, J., Sondjaja, M.: A polynomial-time affine-scaling method for semidefinite and hyperbolic programming. arXiv preprint arXiv:1410.6734 (2014)
- 27.Victor, V.: LMI representations of convex semialgebraic sets and determinantal representations of algebraic hypersurfaces: past, present, and future. In: Mathematical Methods in Systems, Optimization, and Control, pp. 325–349. Springer, London (2012)Google Scholar

## Copyright information

© Springer-Verlag GmbH Germany and Mathematical Optimization Society 2017