scientific article; zbMATH DE number 151654
From MaRDI portal
Publication:4031769
An algorithm is given for solving the problem \(\min_{x\in E}f(x)\), where \(E\) is a finite dimensional Euclidean space and \(f(x)\) is a convex but possibly nondifferentiable function, which is an analogue of Newton's method. The superlinear rate of convergence is proved. The implementation of the algorithm is described. The paper is based on the author's earlier results [Kibernetika, 1986, No. 1, 120-122 (1986; Zbl 0612.90092)].
Recommendations
Cited in
(24)- Proximal quasi-Newton methods for nondifferentiable convex optimization
- The nonlocal Newton method for convex optimization problems and monotone variational inequalities
- Newton-type methods for non-convex optimization under inexact Hessian information
- A multi-step curve search algorithm in nonlinear optimization: nondifferentiable convex case
- scientific article; zbMATH DE number 5926294 (Why is no real title available?)
- scientific article; zbMATH DE number 4141427 (Why is no real title available?)
- Algorithm for nonsmooth optimization
- scientific article; zbMATH DE number 3898629 (Why is no real title available?)
- scientific article; zbMATH DE number 3924518 (Why is no real title available?)
- scientific article; zbMATH DE number 3938461 (Why is no real title available?)
- scientific article; zbMATH DE number 4066649 (Why is no real title available?)
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 4104724 (Why is no real title available?)
- scientific article; zbMATH DE number 123336 (Why is no real title available?)
- Superlinear convergence in convex nondifferentiable optimization
- scientific article; zbMATH DE number 590870 (Why is no real title available?)
- scientific article; zbMATH DE number 1070386 (Why is no real title available?)
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- scientific article; zbMATH DE number 2158987 (Why is no real title available?)
- On an algorithm in nondifferential convex optimization
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- Nesterov's Method for Convex Optimization
- Newton's method for minimizing a convex twice differentiable function on a preconvex set
- Optimization of upper semidifferentiable 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 Q4031769)
