Faster subgradient methods for functions with Hölderian growth (Q2297653)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster subgradient methods for functions with Hölderian growth	scientific article

Statements

scholarly article

0 references

Faster subgradient methods for functions with Hölderian growth (English)

0 references

zbMATH Open document ID

0 references

10.1007/s10107-018-01361-0

0 references

Patrick R. Johnstone

0 references

0 references

Mathematical Programming. Series A. Series B

0 references

publication date

20 February 2020

0 references

full work available at URL

https://arxiv.org/abs/1704.00196

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

Convex analysis and monotone operator theory in Hilbert spaces

0 references

Linearly convergent away-step conditional gradient for non-strongly convex functions

0 references

0 references

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems

0 references

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

0 references

0 references

Weak Sharp Minima in Mathematical Programming

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions

0 references

A three-operator splitting scheme and its optimization applications

0 references

Finite termination of the proximal point algorithm

0 references

0 references

First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games

0 references

On convergence rates of subgradient optimization methods

0 references

0 references

Faster subgradient methods for functions with Hölderian growth

0 references

Online Learning with Kernels

0 references

Global error bounds for piecewise convex polynomials

0 references

Activity Identification and Local Linear Convergence of Forward--Backward-type Methods

0 references

On the Convergence Rate for Stochastic Approximation in the Nonsmooth Setting

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)

0 references

0 references

The effect of deterministic noise in subgradient methods

0 references

Robust Stochastic Approximation Approach to Stochastic Programming

0 references

Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality

0 references

Error bounds in mathematical programming

0 references

Nonlinear programming methods in the presence of noise

0 references

0 references

``Efficient” Subgradient Methods for General Convex Optimization

0 references

A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs

0 references

Approximation accuracy, gradient methods, and error bound for structured convex optimization

0 references

The \(L_1\) penalized LAD estimator for high dimensional linear regression

0 references

Coordinate descent algorithms for lasso penalized regression

0 references

RSG: Beating Subgradient Method without Smoothness and Strong Convexity

0 references

A unified approach to error bounds for structured convex optimization problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2297653

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2297653&oldid=36562669"