Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: fminsearch / rank
 
Normal rank
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: UNLocBoX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11750-017-0462-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2745946318 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59607693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual subgradient methods for convex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally Convergent Trust-Region Method for Large-Scale Symmetric Nonlinear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gradient methods for minimizing composite functions / 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: Optimal subgradient algorithms for large-scale convex optimization in simple domains / 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: Mirror descent and nonlinear projected subgradient methods for convex optimization. / 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: The CoMirror algorithm for solving nonsmooth constrained convex problems / 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: On the acceleration of the double smoothing technique for unconstrained convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Primal-Dual Methods for a Class of Saddle Point Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated schemes for a class of variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Accelerated Linearized Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast bundle-level methods for unconstrained and ball-constrained convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteratively reweighted least squares minimization for sparse recovery / 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: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Finding Structured Sparse Solutions to Nonnegative Least Squares Problems with Applications / 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: Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions / 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: Nonsmooth equation based BFGS method for solving KKT systems in mathematical 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: Smooth minimization of non-smooth functions / 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: Barrier subgradient method / 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: OSGA: a fast subgradient algorithm with optimal complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth Equations: Motivation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secant methods for semismooth equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4946118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation via weighted \(\ell_{1}\) minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems / rank
 
Normal rank

Latest revision as of 16:14, 15 July 2024

scientific article
Language Label Description Also known as
English
Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
scientific article

    Statements

    Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    structured nonsmooth convex optimization
    0 references
    subgradient methods
    0 references
    proximity operator
    0 references
    optimal complexity
    0 references
    first-order black-box information
    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