Pages that link to "Item:Q683737"
From MaRDI portal
The following pages link to Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications (Q683737):
Displaying 14 items.
- A study on distributed optimization over large-scale networked systems (Q2036031) (← links)
- Bilinear constraint based ADMM for mixed Poisson-Gaussian noise removal (Q2037216) (← links)
- An objective penalty function method for biconvex programming (Q2052381) (← links)
- Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm (Q2103717) (← links)
- Solving blind ptychography effectively via linearized alternating direction method of multipliers (Q2111179) (← links)
- The alternating direction method of multipliers for finding the distance between ellipsoids (Q2244162) (← links)
- A hybrid algorithm for the two-trust-region subproblem (Q2322760) (← links)
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization (Q2425169) (← links)
- On indefinite quadratic optimization over the intersection of balls and linear constraints (Q2671444) (← links)
- Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
- Smoothing Partially Exact Penalty Function of Biconvex Programming (Q5149527) (← links)
- New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model (Q5864782) (← links)
- An estimation approach for the influential-imitator diffusion (Q6047853) (← links)
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval (Q6079303) (← links)
