On a space extension algorithm for nondifferentiable optimization
From MaRDI portal
Publication:1054275
DOI10.1007/BF00934744zbMath0519.49016MaRDI QIDQ1054275
Publication date: 1984
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
nondifferentiable optimizationstrongly convex functionsapproximate line searchrate of convergence analysisspace extension algorithm
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Convexity of real functions of several variables, generalizations (26B25) Methods of reduced gradient type (90C52)
Cites Work
- Finding the nearest point in A polytope
- On convergence rates of subgradient optimization methods
- Convex Analysis
- Convergence rate of the gradient descent method with dilatation of the space
- Exact penalty functions in nonlinear programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On a space extension algorithm for nondifferentiable optimization