Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices

DOI10.4230/LIPIcs.APPROX-RANDOM.2018.17OpenAlexW2811144592MaRDI QIDQ5009509

Yuichi Yoshida, Amit Levi

Publication date: 4 August 2021

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

zbMATH Keywords

approximation algorithmsgraph limitsmatrix spectral decompositionqudratic function minimization

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Uses Software

• QUALEX
• PMTK

Cites Work

• A linear-time algorithm for trust region problems
• Limits of dense graph sequences
• The maximum spectral radius of \(C_4\)-free graphs of given order and size
• A constrained eigenvalue problem
• Quick approximation to matrices and applications
• Hidden convexity in some nonconvex quadratically constrained quadratic programming
• A new trust region technique for the maximum weight clique problem
• A Derivative-Free Algorithm for Least-Squares Minimization
• New Results on Quadratic Minimization
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Sublinear optimization for machine learning
• Advanced Lectures on Machine Learning
• Fast monte-carlo algorithms for finding low-rank approximations
• An Introduction to Matrix Concentration Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices