Convergence rate of the gradient descent method with dilatation of the space
From MaRDI portal
Publication:5655196
DOI10.1007/BF01070506zbMath0243.90038MaRDI QIDQ5655196
Publication date: 1970
Published in: Cybernetics (Search for Journal in Brave)
Related Items
The stochastic dynamic product cycling problem, Subgradient methods for sharp weakly convex functions, Fixed interval scheduling: models, applications, computational complexity and algorithms, A linear programming primer: from Fourier to Karmarkar, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, A new linear programming algorithm - better or worse than the simplex method?, The ellipsoid method and its consequences in combinatorial optimization, Surrogate duality relaxation for job shop scheduling, Projection algorithms for linear programming, A Lagrangian relaxation approach to the edge-weighted clique problem, The sphere method and the robustness of the ellipsoid algorithm, On convergence rates of subgradient optimization methods, Minimization methods with constraints, Approximation methods for the unconstrained optimization, Optimization of lipschitz continuous functions, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, On the non-polynomiality of the relaxation method for systems of linear inequalities, Modifications and implementation of the ellipsoid algorithm for linear programming, On a space extension algorithm for nondifferentiable optimization, Polynomial algorithms for a class of linear programs, A deep cut ellipsoid algorithm for convex programming: Theory and applications
