Implicit regularity and linear convergence rates for the generalized trust-region subproblem

by   Alex L. Wang, et al.

In this paper we develop efficient first-order algorithms for the generalized trust-region subproblem (GTRS), which has applications in signal processing, compressed sensing, and engineering. Although the GTRS, as stated, is nonlinear and nonconvex, it is well-known that objective value exactness holds for its SDP relaxation under a Slater condition. While polynomial-time SDP-based algorithms exist for the GTRS, their relatively large computational complexity has motivated and spurred the development of custom approaches for solving the GTRS. In particular, recent work in this direction has developed first-order methods for the GTRS whose running times are linear in the sparsity (the number of nonzero entries) of the input data. In contrast to these algorithms, in this paper we develop algorithms for computing ϵ-approximate solutions to the GTRS whose running times are linear in both the input sparsity and the precision log(1/ϵ) whenever a regularity parameter is positive. We complement our theoretical guarantees with numerical experiments comparing our approach against algorithms from the literature. Our numerical experiments highlight that our new algorithms significantly outperform prior state-of-the-art algorithms on sparse large-scale instances.



There are no comments yet.


page 1

page 2

page 3

page 4


The convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem

Solving the trust-region subproblem (TRS) plays a key role in numerical ...

The Generalized Trust Region Subproblem: solution complexity and convex hull results

We consider the Generalized Trust Region Subproblem (GTRS) of minimizing...

A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem

Solving the trust-region subproblem (TRS) plays a key role in numerical ...

Low-regularity integrators for nonlinear Dirac equations

In this work, we consider the numerical integration of the nonlinear Dir...

A Tight Bound of Hard Thresholding

This paper is concerned with the hard thresholding technique which sets ...

Precisely Verifying the Null Space Conditions in Compressed Sensing: A Sandwiching Algorithm

In this paper, we propose new efficient algorithms to verify the null sp...

Can We Do Better Than Random Start? The Power of Data Outsourcing

Many organizations have access to abundant data but lack the computation...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.