Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

DOI10.1109/TSP.2016.2637317MaRDI QIDQ4620717zbMATH OpenOpenAlexFDO

Authors Gesualdo Scutari, Francisco Facchinei, Lorenzo Lampariello

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1601.04059

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell environment. We develop a new class of algorithms enjoying the following distinctive features: i) they are emph{distributed} across the base stations (with limited signaling) and lead to subproblems whose solutions are computable in closed form; and ii) differently from current relaxation-based schemes (e.g., semidefinite relaxation), they are proved to always converge to d-stationary solutions of the aforementioned class of nonconvex problems. Numerical results show that the proposed (distributed) schemes achieve larger worst-case rates (resp. signal-to-noise interference ratios) than state-of-the-art centralized ones while having comparable computational complexity.

Cited in

(19)

• Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks
• DC programming and DCA: thirty years of developments
• Is a finite intersection of balls covered by a finite union of balls in Euclidean spaces?
• Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
• Distributed algorithms for convex problems with linear coupling constraints
• Numerically tractable optimistic bilevel problems
• Asynchronous parallel algorithms for nonconvex optimization
• Distributed nonconvex constrained optimization over time-varying digraphs
• Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
• Distributed Optimization Based on Gradient Tracking Revisited: Enhancing Convergence Rate via Surrogation
• Combining approximation and exact penalty in hierarchical programming
• Iterative methods for parallel convex optimization with fixed point constraints
• scientific article; zbMATH DE number 2204206 (Why is no real title available?)
• Decentralized optimization with affine constraints over time-varying networks
• Open issues and recent advances in DC programming and DCA
• Iterative distributed model predictive control for heterogeneous systems with non-convex coupled constraints
• Iterative distributed model predictive control for nonlinear systems with coupled non-convex constraints and costs
• Decentralized stochastic subgradient projection optimization algorithms over random networks
• DualBi: a dual bisection algorithm for non-convex problems with a scalar complicating constraint

This page was built for publication: Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620717)