Alternating direction method of multipliers for real and complex polynomial optimization models
From MaRDI portal
Publication:5169464
DOI10.1080/02331934.2014.895901zbMath1291.90242OpenAlexW2095695857MaRDI QIDQ5169464
Bo Jiang, Shu-Zhong Zhang, Shi-Qian Ma
Publication date: 10 July 2014
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.895901
alternating direction method of multiplierspolynomial optimizationoptimization with complex variables
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Multilinear algebra, tensor calculus (15A69)
Related Items
Circulant tensors with applications to spectral hypergraph theory and stochastic process, Alternating direction method of multipliers for separable convex optimization of real functions in complex variables, A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors, ADMM for Penalized Quantile Regression in Big Data, An Alternating Augmented Lagrangian method for constrained nonconvex optimization, A two-level distributed algorithm for nonconvex constrained optimization, A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization, Bregman reweighted alternating minimization and its application to image deblurring, Globally maximizing the sum of squares of quadratic forms over the unit sphere, Global convergence of ADMM in nonconvex nonsmooth optimization, A general system for heuristic minimization of convex functions over non-convex sets, Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems, A hybrid second-order method for homogenous polynomial optimization over unit sphere, Approximation algorithms for nonnegative polynomial optimization problems over unit spheres, Characterizing Real-Valued Multivariate Complex Polynomials and Their Symmetric Tensor Representations, A simple effective heuristic for embedded mixed-integer quadratic programming, ADMM for multiaffine constrained optimization, A new updating method for the damped mass-spring systems, An efficient alternating minimization method for fourth degree polynomial optimization, LINEARIZED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR SEPARABLE CONVEX OPTIMIZATION OF REAL FUNCTIONS IN COMPLEX DOMAIN
Uses Software
Cites Work
- Alternating direction method of multipliers for sparse principal component analysis
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Z-eigenvalue methods for a global polynomial optimization problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Eigenvalues of a real supersymmetric tensor
- Global Optimization with Polynomials and the Problem of Moments
- On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors
- Maximum Block Improvement and Polynomial Optimization
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- The Split Bregman Method for L1-Regularized Problems
- Shifted Power Method for Computing Tensor Eigenpairs
- GloptiPoly 3: moments, optimization and semidefinite programming
- Approximation Methods for Polynomial Optimization