Pages that link to "Item:Q122993"
From MaRDI portal
The following pages link to Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers (Q122993):
Displayed 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- ADMM (Q85055) (← links)
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- Log-Contrast Regression with Functional Compositional Predictors: Linking Preterm Infant's Gut Microbiome Trajectories to Neurobehavioral Outcome (Q138028) (← links)
- Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
- The Little Engine that Could: Regularization by Denoising (RED) (Q148569) (← links)
- A Penalized Likelihood Method for Classification With Matrix-Valued Predictors (Q149263) (← links)
- Rare Feature Selection in High Dimensions (Q149281) (← links)
- ADMMsigma (Q149285) (← links)
- Factor-Adjusted Regularized Model Selection (Q150847) (← links)
- Estimation of multiple networks in Gaussian mixture models (Q156054) (← links)
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Hyperspectral unmixing by the alternating direction method of multipliers (Q256081) (← links)
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
- Online learning over a decentralized network through ADMM (Q259131) (← links)
- A hybrid optimization method for multiplicative noise and blur removal (Q268334) (← links)
- Pansharpening image fusion using cross-channel correlation: a framelet-based approach (Q275335) (← links)
- Higher-degree eigenvalue complementarity problems for tensors (Q276860) (← links)
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions (Q284904) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints (Q291885) (← links)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
- On structural decompositions of finite frames (Q295388) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Conic optimization via operator splitting and homogeneous self-dual embedding (Q301735) (← links)
- Joint estimation of precision matrices in heterogeneous populations (Q302425) (← links)
- Volume constrained 2-phase segmentation method utilizing a linear system solver based on the best uniform polynomial approximation of \(x^{- 1/2}\) (Q311414) (← links)
- An algorithm twisted from generalized ADMM for multi-block separable convex minimization models (Q313627) (← links)
- On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models (Q314977) (← links)
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (Q316185) (← links)
- The non-convex sparse problem with nonnegative constraint for signal reconstruction (Q328467) (← links)
- An improved robust ADMM algorithm for quantum state tomography (Q332021) (← links)
- Binary classification posed as a quadratically constrained quadratic programming and solved using particle swarm optimization (Q332770) (← links)
- Convex image denoising via non-convex regularization with parameter selection (Q334269) (← links)
- A variational aggregation framework for patch-based optical flow estimation (Q334281) (← links)
- Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity (Q334319) (← links)
- A multiphase image segmentation based on fuzzy membership functions and L1-norm fidelity (Q334320) (← links)
- Tomographic image reconstruction using training images (Q344271) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- A lasso for hierarchical interactions (Q366961) (← links)
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness (Q366980) (← links)
- Parallel Uzawa method for large-scale minimization of partially separable functions (Q368609) (← links)
- On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities (Q371479) (← links)
- The geometry of least squares in the 21st century (Q373539) (← links)
- Learning with infinitely many features (Q374174) (← links)
- On an inequality of C. Sundberg: a computational investigation via nonlinear programming (Q378266) (← links)
- A parallel splitting method for separable convex programs (Q382899) (← links)
- Alternating projections on nontangential manifolds (Q387545) (← links)