scientific article; zbMATH DE number 3910150
From MaRDI portal
Publication:3686444
zbMATH Open0569.90076MaRDI QIDQ3686444FDOQ3686444
Authors: Yuri Nesterov
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- An Algorithm for Nonsmooth Convex Minimization With Errors
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- One class of methods of unconditional minimization of a convex function, having a high rate of convergence
- Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method
- scientific article; zbMATH DE number 3894826
convergence rateellipsoid methodquasiconvex functionsnonsmooth minimizationcentre-gravity methodmethod of stretching spacessection methodsunconstrained subdifferential method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cited In (28)
- Distribution-specific hardness of learning neural networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal methods of smooth convex minimization
- Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method
- A method for minimizing a quasiconvex function in a two-dimensional plane without computing derivatives
- Title not available (Why is that?)
- Application of the method of conjugate subgradients to minimization of quasiconvex functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A one-bit, comparison-based gradient estimator
- Title not available (Why is that?)
- Minimization methods for smooth nonconvex functions
- On Tracking Varying Bounds When Forecasting Bounded Time Series
- Title not available (Why is that?)
- Quasi-monotone subgradient methods for nonsmooth convex minimization
- A method for convex minimization based on translated first-order approximations
- Primal subgradient methods with predefined step sizes
- Title not available (Why is that?)
- On some difficult linear programs coming from set partitioning
- One class of methods of unconditional minimization of a convex function, having a high rate of convergence
- Minimization of non quasiconvex functionals by integro-extremization method
- Title not available (Why is that?)
- Title not available (Why is that?)
- New variable-metric algorithms for nondifferentiable optimization problems
- Two methods for minimizing convex functions in a class of nonconvex sets
- A multipoint method of minimization of a convex function
- On properties of supporting and quasi-supporting vectors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3686444)