Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127334347, #quickstatements; #temporary_batch_1722035971323
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1801.08285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sums and convex combinations of projectors onto convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Methods in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection onto the simplex and the \(l_1\) ball / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Projection on an Ellipsoid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Minimum Norm Duality Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of projecting the origin of Euclidean space onto the convex polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Fitting the Constrained Lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Point of a Polyhedron Closest to the Origin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting subgradients of minimal time functions in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth minimization of non-smooth functions / 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: Q4235027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``Minimizing finite sums with the stochastic average gradient'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution path of the generalized lasso / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex analysis and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127334347 / rank
 
Normal rank

Latest revision as of 00:25, 27 July 2024

scientific article
Language Label Description Also known as
English
Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
scientific article

    Statements

    Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (English)
    0 references
    0 references
    0 references
    19 December 2019
    0 references
    minimum norm problem
    0 references
    Minkowski sum of sets
    0 references
    Gilbert's algorithm
    0 references
    Nesterov's smoothing technique
    0 references
    fast gradient method
    0 references
    SAGA
    0 references

    Identifiers

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