Optimization for L1-Norm Error Fitting via Data Aggregation

DOI10.1287/ijoc.2019.0908OpenAlexW2623329600MaRDI QIDQ4995061

No author found.

Publication date: 23 June 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.04864

zbMATH Keywords

principal component analysisregressiondata aggregationaggregate and iterative disaggregate

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items

Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications, Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes

Uses Software

• UCI-ml
• Scikit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best subset selection via a modern optimization lens
• A pure \(L_1\)-norm principal component analysis
• Demand point aggregation method for covering problems with gradual coverage
• Solving large-scale linear programs by aggregation
• Choosing the best set of variables in regression analysis using integer programming
• Algorithm for cardinality-constrained quadratic optimization
• Using aggregation to optimize long-term production planning at an underground mine
• Aggregation in large-scale optimization
• An aggregate and iterative disaggregate algorithm with proven optimality in machine learning
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• The \(L_1\)-norm best-fit hyperplane problem
• Two proposals for robust PCA using semidefinite programming
• Solving network design problems via iterative aggregation
• Solving Network Design Problems via Decomposition, Aggregation and Approximation
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• Iterative Aggregation--A New Approach to the Solution of Large-Scale Problems
• Technical Note—Improved Bounds for Aggregated Linear Programs
• Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing
• Efficient L1-Norm Principal-Component Analysis via Bit Flipping
• Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
• Aggregation and Disaggregation in Integer Programming Problems
• An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
• Solution of Large-Scale Transportation Problems Through Aggregation