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-XzbMATH Open1393.90094OpenAlexW2776537859MaRDI QIDQ683737FDOQ683737
Authors: Davood Hajinezhad, Qingjiang Shi 
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
Recommendations
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Analysis of the alternating direction method of multipliers for nonconvex problems
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Local linear convergence of the alternating direction method of multipliers for nonconvex separable optimization problems
- Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
Cites Work
- Principal component analysis.
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- Variational Analysis
- Regularization and Variable Selection Via the Elastic Net
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- A unified convergence analysis of block successive minimization methods for nonsmooth optimization
- Generalized power method for sparse principal component analysis
- Optimal solutions for sparse principal component analysis
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Sparse principal component analysis via regularized low rank matrix approximation
- Multiplier and gradient methods
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Alternating direction methods for classical and ptychographic phase retrieval
- Title not available (Why is that?)
- Variational Analysis and Generalized Differentiation I
- An alternating direction algorithm for matrix completion with nonnegative factors
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- On the convergence of the coordinate descent method for convex differentiable minimization
- High Dimensional Low Rank Plus Sparse Matrix Decomposition
- On the Liu-Floudas convexification of smooth programs
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of splitting methods for nonconvex composite optimization
- A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization
- Distributed Vector Estimation for Power- and Bandwidth-Constrained Wireless Sensor Networks
- Decentralized learning for wireless communications and networking
Cited In (23)
- 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
- Block-simultaneous direction method of multipliers: a proximal primal-dual splitting algorithm for nonconvex problems with multiple constraints
- The alternating direction method of multipliers for finding the distance between ellipsoids
- Solving blind ptychography effectively via linearized alternating direction method of multipliers
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval
- New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- An estimation approach for the influential-imitator diffusion
- A study on distributed optimization over large-scale networked systems
- Global optimization for non-convex programs via convex proximal point method
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- Bilinear constraint based ADMM for mixed Poisson-Gaussian noise removal
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- A filter alternating direction method of multipliers for finding global minimum of biconvex optimization
- Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces
- On indefinite quadratic optimization over the intersection of balls and linear constraints
- Alternating direction method for bi-quadratic programming
- Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method
- Smoothing partially exact penalty function of biconvex programming
- Iteratively Linearized Reweighted Alternating Direction Method of Multipliers for a Class of Nonconvex Problems
- An objective penalty function method for biconvex programming
- Preconditioned ADMM for a class of bilinear programming problems
Uses Software
This page was built for publication: Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q683737)
