Yang et al., 2017 - Google Patents
A unified successive pseudoconvex approximation frameworkYang et al., 2017
View PDF- Document ID
- 12891230700859894097
- Author
- Yang Y
- Pesavento M
- Publication year
- Publication venue
- IEEE Transactions on Signal Processing
External Links
Snippet
In this paper, we propose a successive pseudoconvex approximation algorithm to efficiently compute stationary points for a large class of possibly nonconvex optimization problems. The stationary points are obtained by solving a sequence of successively refined …
- 238000005457 optimization 0 abstract description 37
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | A unified successive pseudoconvex approximation framework | |
| Liu et al. | Online successive convex approximation for two-stage stochastic nonconvex optimization | |
| Yang et al. | A parallel decomposition method for nonconvex stochastic multi-agent optimization problems | |
| Bunea et al. | The group square-root lasso: Theoretical properties and fast algorithms | |
| Razaviyayn et al. | A unified convergence analysis of block successive minimization methods for nonsmooth optimization | |
| Raja et al. | Cloud K-SVD: A collaborative dictionary learning algorithm for big, distributed data | |
| Facchinei et al. | Parallel selective algorithms for nonconvex big data optimization | |
| Dong et al. | Blind over-the-air computation and data fusion via provable wirtinger flow | |
| Mansoori et al. | A fast distributed asynchronous Newton-based optimization algorithm | |
| Yamashita et al. | A primal–dual interior point method for nonlinear semidefinite programming | |
| Gross et al. | Distributed power control algorithm for multiple access systems based on Verhulst model | |
| Huang et al. | A unified primal dual active set algorithm for nonconvex sparse recovery | |
| Sutter et al. | Efficient approximation of quantum channel capacities | |
| Csáji et al. | Non-asymptotic confidence regions for the least-squares estimate | |
| Florea et al. | An accelerated composite gradient method for large-scale composite objective problems | |
| Matthiesen et al. | Mixed monotonic programming for fast global optimization | |
| Mokhtari et al. | Network newton-part i: Algorithm and convergence | |
| Mansoori et al. | FlexPD: A flexible framework of first-order primal-dual algorithms for distributed optimization | |
| Zhang et al. | A penalty alternating direction method of multipliers for convex composite optimization over decentralized networks | |
| Shi et al. | Topological interference management with user admission control via Riemannian optimization | |
| Bertsimas et al. | A new perspective on low-rank optimization | |
| Shi et al. | A semismooth newton algorithm for high-dimensional nonconvex sparse learning | |
| Pan et al. | Adaptive importance sampling for extreme quantile estimation with stochastic black box computer models | |
| Alonso et al. | Distributed and localized model-predictive control–part i: Synthesis and implementation | |
| França et al. | Distributed optimization, averaging via ADMM, and network topology |