Recent Theoretical Advances in Non-Convex Optimization (Q6355806)

scientific article; zbMATH DE number 7598275

Language	Label	Description	Also known as
English	Recent Theoretical Advances in Non-Convex Optimization	scientific article; zbMATH DE number 7598275

Statements

instance of

scholarly article

0 references

publication date

11 December 2020

0 references

arXiv classification

math.OC

0 references

cs.LG

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Finding approximate local minima faster than gradient descent

0 references

Optimization with Sparsity-Inducing Penalties

0 references

A simple proof of the restricted isometry property for random matrices

0 references

Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation

0 references

Lectures on Modern Convex Optimization

0 references

Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise

0 references

A theoretical and empirical comparison of gradient approximations in derivative-free optimization

0 references

Stochastic Three Points Method for Unconstrained Smooth Minimization

0 references

Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

0 references

Foundations of Data Science

0 references

Iterative hard thresholding for compressed sensing

0 references

Large-Scale Machine Learning with Stochastic Gradient Descent

0 references

Optimization Methods for Large-Scale Machine Learning

0 references

Q4821526

0 references

Q2809807

0 references

Exact matrix completion via convex optimization

0 references

Decoding by Linear Programming

0 references

The Power of Convex Relaxation: Near-Optimal Matrix Completion

0 references

Enhancing sparsity by reweighted \(\ell _{1}\) minimization

0 references

Phase Retrieval via Wirtinger Flow: Theory and Algorithms

0 references

Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step

0 references

Accelerated Methods for NonConvex Optimization

0 references

Lower bounds for finding stationary points II: first-order methods

0 references

Lower bounds for finding stationary points I

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

A concise second-order complexity analysis for unconstrained optimization using high-order regularized models

0 references

Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy

0 references

Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

Proximal Splitting Methods in Signal Processing

0 references

Trust Region Methods

0 references

Introduction to Derivative-Free Optimization

0 references

Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization

0 references

Stochastic Model-Based Minimization of Weakly Convex Functions

0 references

Generalized Momentum-Based Methods: A Hamiltonian Perspective

0 references

Q5396673

0 references

An accelerated directional derivative method for smooth stochastic convex optimization

0 references

First-order methods for convex optimization

0 references

Numerical methods for finding global extrema (Case of a non-uniform mesh)

0 references

Optimizing Static Linear Feedback: Gradient Method

0 references

Q2921693

0 references

Encyclopedia of Optimization

0 references

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

0 references

Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming

0 references

Accelerated gradient methods for nonconvex nonlinear and stochastic programming

0 references

Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization

0 references

Generalized uniformly optimal methods for nonlinear programming

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Q5270493

0 references

An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization

0 references

Generalized descent for global optimization

0 references

Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems

0 references

Alternating minimization methods for strongly convex optimization

0 references

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary

0 references

Non-convex Optimization for Machine Learning

0 references

Low-rank matrix completion using alternating minimization

0 references

On Nonconvex Optimization for Machine Learning

0 references

Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?

0 references

Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements: the multivariate case

0 references

First-order and stochastic optimization methods for machine learning

0 references

Accelerated Stochastic Algorithms for Nonconvex Finite-Sum and Multiblock Optimization

0 references

Derivative-free optimization methods

0 references

Identifiability in Blind Deconvolution With Subspace or Sparsity Constraints

0 references

Q5643297

0 references

Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning

0 references

Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems

0 references

Some NP-complete problems in quadratic and nonlinear programming

0 references

A Simplex Method for Function Minimization

0 references

Q3320132

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Lectures on convex optimization

0 references

Cubic regularization of Newton method and its global performance

0 references

Random gradient-free minimization of convex functions

0 references

Primal–dual accelerated gradient methods with small-dimensional relaxation oracle

0 references

Q5491447

0 references

Combining stochastic adaptive cubic regularization with negative curvature for nonconvex optimization

0 references

Q5593503

0 references

Some methods of speeding up the convergence of iteration methods

0 references

Q3491338

0 references

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

0 references

Minimizing finite sums with the stochastic average gradient

0 references

Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently

0 references

Zeroth-order methods for noisy Hölder-gradient functions

0 references

Q5532163

0 references

Incremental gradient algorithms with stepsizes bounded away from zero

0 references

Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks

0 references

Parametric estimation. Finite sample theory

0 references

Gradient methods for problems with inexact model of the objective

0 references

Inexact model: a framework for optimization and variational inequalities

0 references

An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule

0 references

Black-Box Complexity of Local Minimization

0 references

Q5149016

0 references

Q5121146

0 references

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

0 references

Misspecified nonconvex statistical optimization for sparse phase retrieval

0 references

Stochastic global optimization.

0 references

Q5214226

0 references

An adaptive high order method for finding third-order critical points of nonconvex optimization

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-00832-0_3

0 references

title

Recent Theoretical Advances in Non-Convex Optimization (English)

0 references

Identifiers

arXiv ID

2012.06188

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH Open document ID

1527.90169

0 references

DOI

10.1007/978-3-031-00832-0_3

0 references

OpenAlex ID

W3113216837

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6355806