Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
From MaRDI portal
Publication:126401
DOI10.1080/10618600.2017.1366915OpenAlexW2963167563MaRDI QIDQ126401FDOQ126401
Authors: Xin Yee Lam, Defeng Sun, Kim-Chuan Toh, Xin Yee Lam, Defeng Sun, Kim-Chuan Toh, J. S. Marron 
Publication date: 3 April 2018
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.05473
Cites Work
- LIBLINEAR: a library for large linear classification
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Distance-Weighted Discrimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- Hankel matrix rank minimization with applications to system identification and realization
- Overview of object oriented data analysis
- Do we need hundreds of classifiers to solve real world classification problems?
- Another look at distance-weighted discrimination
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Weighted distance weighted discrimination and its asymptotic properties
- A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
- A unified formulation and fast accelerated proximal gradient method for classification
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
Cited In (20)
- Robust tensor completion: equivalent surrogates, error bounds, and algorithms
- Data science, big data and statistics
- Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
- A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications
- Learning Markov models via low-rank optimization
- A new homotopy proximal variable-metric framework for composite convex minimization
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
- A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems
- diproperm
- Title not available (Why is that?)
- Title not available (Why is that?)
- An ADMM algorithm for two-stage stochastic programming problems
- A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems
- A proximal point dual Newton algorithm for solving group graphical Lasso problems
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
- Portfolio selection with regularization
- An application of sparse-group Lasso regularization to equity portfolio optimization and sector selection
- Large dimensional analysis of general margin based classification methods
Uses Software
This page was built for publication: Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q126401)
