Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59607367, #quickstatements; #temporary_batch_1707303357582
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: NESUN / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Regularization tools / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TFOCS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: UNLocBoX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1557199071 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.01451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Selection and Estimation in Regression with Grouped Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excessive Gap Technique in Nonsmooth Convex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficiency of nonmonotone Armijo-type line searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Subgradient Methods for Nondifferentiable Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal subgradient algorithm with subspace search for costly convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal subgradient algorithm for large-scale bound-constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Nonsmooth Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonnegatively Constrained Convex Programming Method for Image Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and First Order Methods: A Unified Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Templates for convex cone problems with applications to sparse signal recovery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient Convergence in Gradient methods with Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Spectral Projected Gradient Methods on Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order primal-dual algorithm for convex problems with applications to imaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3078296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Total Variation Deblurring Models and Fast Algorithms Based on Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Splitting Methods in Signal Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order methods of smooth convex optimization with inexact oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Constrained Differentiable Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization tools version \(4.0\) for matlab \(7.3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ridge Regression: Biased Estimation for Nonorthogonal Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3967358 / 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: Q3320132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal gradient methods for convex optimization 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: Gradient methods for minimizing composite functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: OSGA: a fast subgradient algorithm with optimal complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank

Latest revision as of 22:38, 14 July 2024

scientific article
Language Label Description Also known as
English
Optimal subgradient algorithms for large-scale convex optimization in simple domains
scientific article

    Statements

    Optimal subgradient algorithms for large-scale convex optimization in simple domains (English)
    0 references
    0 references
    0 references
    12 January 2018
    0 references
    structured convex optimization
    0 references
    nonsmooth optimization
    0 references
    optimal complexity
    0 references
    first-order black-box information
    0 references
    subgradient method
    0 references
    high-dimensional data
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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