scientific article; zbMATH DE number 3910150
From MaRDI portal
Publication:3686444
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
Cited in
(28)- A multipoint method of minimization of a convex function
- scientific article; zbMATH DE number 1421092 (Why is no real title available?)
- Quasi-monotone subgradient methods for nonsmooth convex minimization
- Primal subgradient methods with predefined step sizes
- Optimal methods of smooth convex minimization
- scientific article; zbMATH DE number 4119961 (Why is no real title available?)
- scientific article; zbMATH DE number 3961354 (Why is no real title available?)
- scientific article; zbMATH DE number 3904352 (Why is no real title available?)
- scientific article; zbMATH DE number 5197127 (Why is no real title available?)
- scientific article; zbMATH DE number 3896697 (Why is no real title available?)
- A one-bit, comparison-based gradient estimator
- A method for minimizing a quasiconvex function in a two-dimensional plane without computing derivatives
- scientific article; zbMATH DE number 93109 (Why is no real title available?)
- Application of the method of conjugate subgradients to minimization of quasiconvex functions
- A method for convex minimization based on translated first-order approximations
- New variable-metric algorithms for nondifferentiable optimization problems
- On Tracking Varying Bounds When Forecasting Bounded Time Series
- scientific article; zbMATH DE number 1450255 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Minimization of non quasiconvex functionals by integro-extremization method
- 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 a non-smooth, strongly quasi-convex function by a conditional gradient type method
- Distribution-specific hardness of learning neural networks
- Two methods for minimizing convex functions in a class of nonconvex sets
- scientific article; zbMATH DE number 2206826 (Why is no real title available?)
- On properties of supporting and quasi-supporting vectors
- Minimization methods for smooth nonconvex functions
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)