Recent Theoretical Advances in Non-Convex Optimization
type: Item
instance of: scholarly article
publication date: 2020-12-11T00:00:00Z
arXiv ID: 2012.06188
arXiv classification: math.OC
arXiv classification: cs.LG
author: Marina Danilova
author: Pavel Dvurechensky
author: A. V. Gasnikov
author: Eduard Gorbunov
author: Sergey Guminov
author: Dmitry Kamzolov
author: Innokentiy Shibaev
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7598275
zbMATH Open document ID: 1527.90169
DOI: 10.1007/978-3-031-00832-0_3
MaRDI profile type: MaRDI publication profile
cites work: Finding approximate local minima faster than gradient descent
cites work: Optimization with sparsity-inducing penalties
cites work: A simple proof of the restricted isometry property for random matrices
cites work: Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
cites work: A theoretical and empirical comparison of gradient approximations in derivative-free optimization
cites work: Stochastic Three Points Method for Unconstrained Smooth Minimization
cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
cites work: Foundations of Data Science
cites work: Iterative hard thresholding for compressed sensing
cites work: Large-Scale Machine Learning with Stochastic Gradient Descent
cites work: Optimization Methods for Large-Scale Machine Learning
cites work: Q4821526
cites work: Convex optimization: algorithms and complexity
cites work: Exact matrix completion via convex optimization
cites work: Decoding by Linear Programming
cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: Phase Retrieval via Wirtinger Flow: Theory and Algorithms
cites work: Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
cites work: Accelerated Methods for NonConvex Optimization
cites work: Lower bounds for finding stationary points II: first-order methods
cites work: Lower bounds for finding stationary points I
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: A concise second-order complexity analysis for unconstrained optimization using high-order regularized models
cites work: Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
cites work: Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
cites work: Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview
cites work: Proximal Splitting Methods in Signal Processing
cites work: Trust Region Methods
cites work: Introduction to Derivative-Free Optimization
cites work: Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization
cites work: Stochastic Model-Based Minimization of Weakly Convex Functions
cites work: Generalized Momentum-Based Methods: A Hamiltonian Perspective
cites work: Q5396673
cites work: An accelerated directional derivative method for smooth stochastic convex optimization
cites work: First-order methods for convex optimization
cites work: Numerical methods for finding global extrema (Case of a non-uniform mesh)
cites work: Optimizing Static Linear Feedback: Gradient Method
cites work: Online convex optimization in the bandit setting: gradient descent without a gradient
cites work: Encyclopedia of Optimization
cites work: About the Power Law of the PageRank Vector Component Distribution. Part 2. The Buckley–Osthus Model, Verification of the Power Law for This Model, and Setup of Real Search Engines
cites work: Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
cites work: Accelerated gradient methods for nonconvex nonlinear and stochastic programming
cites work: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
cites work: Generalized uniformly optimal methods for nonlinear programming
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q5270493
cites work: An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization
cites work: Generalized descent for global optimization
cites work: Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
cites work: Alternating minimization methods for strongly convex optimization
cites work: Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
cites work: Non-convex Optimization for Machine Learning
cites work: Low-rank matrix completion using alternating minimization
cites work: On Nonconvex Optimization for Machine Learning
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case
cites work: First-order and stochastic optimization methods for machine learning

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Derivative-free optimization methods

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5643297

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Some NP-complete problems in quadratic and nonlinear programming

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: A Simplex Method for Function Minimization

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q3320132

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Introductory lectures on convex optimization. A basic course.

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Lectures on convex optimization

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Cubic regularization of Newton method and its global performance

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Random gradient-free minimization of convex functions

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Primal–dual accelerated gradient methods with small-dimensional relaxation oracle

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5491447

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5593503

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Some methods of speeding up the convergence of iteration methods

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q3491338

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Minimizing finite sums with the stochastic average gradient

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Zeroth-order methods for noisy Hölder-gradient functions

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5532163

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Incremental gradient algorithms with stepsizes bounded away from zero

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Parametric estimation. Finite sample theory

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Gradient methods for problems with inexact model of the objective

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Inexact model: a framework for optimization and variational inequalities

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Black-Box Complexity of Local Minimization

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5149016

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5121146

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Newton-type methods for non-convex optimization under inexact Hessian information

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Misspecified nonconvex statistical optimization for sparse phase retrieval

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Stochastic global optimization.

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: Q5214226

Recent Theoretical Advances in Non-Convex Optimization (cites work)
cites work: An adaptive high order method for finding third-order critical points of nonconvex optimization

Recent Theoretical Advances in Non-Convex Optimization (full work available at URL)
full work available at URL: 978-3-031-00832-0 3

Recent Theoretical Advances in Non-Convex Optimization (OpenAlex ID)
OpenAlex ID: W3113216837

Recent Theoretical Advances in Non-Convex Optimization (title)
title: Recent Theoretical Advances in Non-Convex Optimization