Iterated Linear Optimization

We introduce a fixed point iteration process built on optimization of a linear function over a compact domain. We prove the process always converges to a fixed point and explore the set of fixed points in various convex sets. In particular, we consider elliptopes and derive an algebraic characterization of their fixed points. We show that the attractive fixed points of an elliptope are exactly its vertices. Finally, we discuss how fixed point iteration can be used for rounding the solution of a semidefinite programming relaxation.

[1]  S. Poljak,et al.  On a positive semidefinite relaxation of the cut polytope , 1995 .

[2]  Bernd Sturmfels,et al.  The geometry of SDP-exactness in quadratic optimization , 2018, Math. Program..

[3]  David Steurer,et al.  Rounding sum-of-squares relaxations , 2013, Electron. Colloquium Comput. Complex..

[4]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[5]  Philip Wolfe,et al.  An algorithm for quadratic programming , 1956 .

[6]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[7]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[8]  Alice Paul,et al.  Clustering with Iterated Linear Optimization , 2020, ArXiv.

[9]  Richard A. Holmgren.  A First Course in Discrete Dynamical Systems , 1994 .

[10]  Oded Galor,et al.  Discrete Dynamical Systems , 2005 .

[11]  M. D. Asic,et al.  Limit Points of Sequences in Metric Spaces , 1970 .

[12]  V. Berinde.  Iterative Approximation of Fixed Points , 2007 .

[13]  Prasad Raghavendra,et al.  How to Round Any CSP , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Heinz H. Bauschke,et al.  Fixed-Point Algorithms for Inverse Problems in Science and Engineering , 2011, Springer Optimization and Its Applications.

[15]  Rekha R. Thomas,et al.  On the local stability of semidefinite relaxations , 2017, Mathematical Programming.

[16]  Monique Laurent,et al.  Cuts, matrix completions and graph rigidity , 1997, Math. Program..