Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
From MaRDI portal
Publication:683737
DOI10.1007/s10898-017-0594-xzbMath1393.90094OpenAlexW2776537859MaRDI QIDQ683737
Qingjiang Shi, Davood Hajinezhad
Publication date: 9 February 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-017-0594-x
Related Items
On indefinite quadratic optimization over the intersection of balls and linear constraints, An estimation approach for the influential-imitator diffusion, Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval, Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization, Global optimization for non-convex programs via convex proximal point method, Smoothing Partially Exact Penalty Function of Biconvex Programming, The alternating direction method of multipliers for finding the distance between ellipsoids, A study on distributed optimization over large-scale networked systems, Bilinear constraint based ADMM for mixed Poisson-Gaussian noise removal, An objective penalty function method for biconvex programming, A hybrid algorithm for the two-trust-region subproblem, Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm, New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model, Solving blind ptychography effectively via linearized alternating direction method of multipliers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An alternating direction algorithm for matrix completion with nonnegative factors
- Sparse principal component analysis via regularized low rank matrix approximation
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- On the convergence of the coordinate descent method for convex differentiable minimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Principal component analysis.
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- On the Liu-Floudas convexification of smooth programs
- Multiplier and gradient methods
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Generalized power method for sparse principal component analysis
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
- Alternating direction methods for classical and ptychographic phase retrieval
- A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Variational Analysis
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- High Dimensional Low Rank Plus Sparse Matrix Decomposition
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- Distributed Vector Estimation for Power- and Bandwidth-Constrained Wireless Sensor Networks
- Variational Analysis and Generalized Differentiation I
- Regularization and Variable Selection Via the Elastic Net
- Decentralized Learning for Wireless Communications and Networking
- Projected Gradient Methods for Nonnegative Matrix Factorization
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Convergence of a block coordinate descent method for nondifferentiable minimization
