Sharp quadratic majorization in one dimension

DOI10.1016/j.csda.2009.01.002zbMath1453.62078OpenAlexW1992895585WikidataQ41760862 ScholiaQ41760862MaRDI QIDQ961662

Jan de Leeuw, Kenneth L. Lange

Publication date: 1 April 2010

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc3129714

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items (11)

A globally convergent algorithm for Lasso-penalized mixture of linear regression models ⋮ Autoregressive processes with generalized hyperbolic innovations ⋮ Multivariate sharp quadratic bounds via \(\boldsymbol{\Sigma}\)-strong convexity and the Fenchel connection ⋮ A Legacy of EM Algorithms ⋮ A mixture of generalized hyperbolic distributions ⋮ The MM alternative to EM ⋮ A majorization algorithm for simultaneous parameter estimation in robust exploratory factor analysis ⋮ In the pursuit of sparseness: a new rank-preserving penalty for a finite mixture of factor analyzers ⋮ Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm ⋮ Conditionally conjugate mean-field variational Bayes for logistic models ⋮ Screening for chronic diseases: optimizing lead time through balancing prescribed frequency and individual adherence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SVM-Maj: a majorization approach to linear support vector machines with different hinge errors
• Correspondence analysis with least absolute residuals
• Monotonicity of quadratic-approximation algorithms
• Principal component analysis of binary data by iterated singular value decomposition
• Resistant lower rank approximation of matrices by iterative majorization
• Variable selection using MM algorithms
• On Nonlinear Fractional Programming

This page was built for publication: Sharp quadratic majorization in one dimension