pith. sign in

arxiv: 1610.04329 · v2 · pith:XIGRTGEOnew · submitted 2016-10-14 · 🧮 math.OC

HONES: A Fast and Tuning-free Homotopy Method For Online Newton Step

classification 🧮 math.OC
keywords honesfastgeneralizedhomotopymethodnewtononlinesequential
0
0 comments X
read the original abstract

In this article, we develop and analyze a homotopy continuation method, referred to as HONES , for solving the sequential generalized projections in Online Newton Step, as well as the generalized problem known as sequential standard quadratic programming. HONES is fast, tuning-free, error-free (up to machine error) and adaptive to the solution sparsity. This is confirmed by both careful theoretical analysis and extensive experiments on both synthetic and real data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.