No label defined (Q5214226)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7164734

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7164734

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

publication date

7 February 2020

0 references

full work available at URL

http://jmlr.csail.mit.edu/papers/v20/19-055.html

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

cubic regularization

0 references

nonconvex optimization

0 references

variance reduction

0 references

Hessian sample complexity

0 references

local minimum

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Finding approximate local minima faster than gradient descent

0 references

0 references

Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step

0 references

Accelerated Methods for NonConvex Optimization

0 references

Trust-region and other regularisations of linear least-squares problems

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

Complexity bounds for second-order optimality in unconstrained optimization

0 references

On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization

0 references

The masked sample covariance estimator: an analysis using matrix concentration inequalities

0 references

Trust Region Methods

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

0 references

A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization

0 references

Most Tensor Problems Are NP-Hard

0 references

Matrix concentration inequalities via the method of exchangeable pairs

0 references

Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization

0 references

0 references

Cubic regularization of Newton method and its global performance

0 references

Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization

0 references

The Expected Norm of a Sum of Independent Random Matrices: An Elementary Approach

0 references

An Introduction to Matrix Concentration Inequalities

0 references

A Proximal Stochastic Gradient Method with Progressive Variance Reduction

0 references

Newton-type methods for non-convex optimization under inexact Hessian information

0 references

Robust linear regression: A review and comparison

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5214226

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