Corpus ID: 1225017

Efficient evaluation of scaled proximal operators

@article{Friedlander2016EfficientEO,
  title={Efficient evaluation of scaled proximal operators},
  author={Michael P. Friedlander and Gabriel Goh},
  journal={ArXiv},
  year={2016},
  volume={abs/1603.05719}
}
  • Michael P. Friedlander, Gabriel Goh
  • Published 2016
  • Computer Science, Mathematics
  • ArXiv
  • Quadratic-support functions [Aravkin, Burke, and Pillonetto; J. Mach. Learn. Res. 14(1), 2013] constitute a parametric family of convex functions that includes a range of useful regularization terms found in applications of convex optimization. We show how an interior method can be used to efficiently compute the proximal operator of a quadratic-support function under different metrics. When the metric and the function have the right structure, the proximal map can be computed with cost nearly… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 11 CITATIONS

    Cardinality , Simplex and Proximal Operator

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Generalized self-concordant functions: a recipe for Newton-type methods

    VIEW 1 EXCERPT
    CITES BACKGROUND

    One-Step Estimation With Scaled Proximal Methods

    VIEW 2 EXCERPTS
    CITES METHODS & BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 50 REFERENCES

    Proximal Newton-Type Methods for Minimizing Composite Functions

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL

    An Interior-Point Method for Large-Scale $\ell_1$-Regularized Least Squares