Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization
Abstract
This study develops a framework for a class of constant modulus (CM) optimization problems, which covers binary constraints, discrete phase constraints, semi-orthogonal matrix constraints, non-negative semi-orthogonal matrix constraints, and several types of binary assignment constraints. Capitalizing on the basic principles of concave minimization and error bounds, we study a convex-constrained penalized formulation for general CM problems. The advantage of such formulation is that it allows us to leverage non-convex optimization techniques, such as the simple projected gradient method, to build algorithms. As the first part of this study, we explore the theory of this framework. We study conditions under which the formulation provides exact penalization results. We also examine computational aspects relating to the use of the projected gradient method for each type of CM constraint. Our study suggests that the proposed framework has a broad scope of applicability.
Cite
@article{arxiv.2403.06506,
title = {Extreme Point Pursuit -- Part I: A Framework for Constant Modulus Optimization},
author = {Junbin Liu and Ya Liu and Wing-Kin Ma and Mingjie Shao and Anthony Man-Cho So},
journal= {arXiv preprint arXiv:2403.06506},
year = {2024}
}