Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-015-0969-z / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-015-0969-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2279141731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwise coordinate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Group Lasso for Logistic Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A coordinate gradient descent method for nonsmooth separable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Block-coordinate Relaxation for Regularized Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinate descent algorithms for lasso penalized regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-015-0969-Z / rank
 
Normal rank

Latest revision as of 15:00, 9 December 2024

scientific article
Language Label Description Also known as
English
Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
scientific article

    Statements

    Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (English)
    0 references
    0 references
    0 references
    25 November 2016
    0 references
    nonsmooth optimization
    0 references
    block coordinate proximal gradient methods
    0 references
    linear convergence
    0 references
    error bounds
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references