scientific article; zbMATH DE number 7370577
From MaRDI portal
Publication:4998960
No author found.
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1904.12017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convex optimizationgraphsalternating direction method of multipliersstratified modelsLaplacian regularization
Related Items (4)
Eigen-stratified models ⋮ Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ Fitting Laplacian regularized stratified Gaussian models ⋮ Covariance prediction via convex optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nonlinear total variation based noise removal algorithms
- Sparse inverse covariance estimation with the graphical lasso
- Random-Effects Models for Longitudinal Data
- Statistical methods with varying coefficient models
- Linear and generalized linear mixed models and their applications.
- On the limited memory BFGS method for large scale optimization
- Time-dependent coefficients in a Cox-type regression model
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- That BLUP is a good thing: The estimation of random effects. With comments and a rejoinder by the author
- Data shared Lasso: a novel tool to discover uplift
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Proximal algorithms in statistics and machine learning
- Linear mixed models and penalized least squares
- Support-vector networks
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Covariance-Regularized Regression and Classification for high Dimensional Problems
- Polytomous logistic regression
- Introduction to Information Retrieval
- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
- The Group Lasso for Logistic Regression
- Newton-Raphson and EM Algorithms for Linear Mixed-Effects Models for Repeated-Measures Data
- Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
- Approximate Inference in Generalized Linear Mixed Models
- Semidefinite Programming
- A Pliable Lasso
- Selection and estimation for mixed graphical models
- Solving SDD linear systems in nearly m log 1/2 n time
- Sparse Matrix Factorizations for Fast Linear Solvers with Application to Laplacian Systems
- SnapVX: A Network-Based Convex Optimization Solver
- Lx = b
- Model Selection and Estimation in Regression with Grouped Variables
- Robust Estimation of a Location Parameter
- On Distributions Admitting a Sufficient Statistic
- Methods of conjugate gradients for solving linear systems
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
This page was built for publication:
