Pages that link to "Item:Q5655196"
From MaRDI portal
The following pages link to Convergence rate of the gradient descent method with dilatation of the space (Q5655196):
Displaying 22 items.
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- On a space extension algorithm for nondifferentiable optimization (Q1054275) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Surrogate duality relaxation for job shop scheduling (Q1171504) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- Minimization methods with constraints (Q1234628) (← links)
- Approximation methods for the unconstrained optimization (Q1234630) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- The stochastic dynamic product cycling problem (Q1330541) (← links)
- Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
- A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- The sphere method and the robustness of the ellipsoid algorithm (Q3039036) (← links)
- On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- On convergence rates of subgradient optimization methods (Q4145170) (← links)
- Optimization of lipschitz continuous functions (Q4177351) (← links)
- Polynomial algorithms for a class of linear programs (Q4749597) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- Polyak minorant method for convex optimization (Q6655787) (← links)
