The following pages link to (Q5655195):
Displaying 11 items.
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- A ``build-down'' scheme for linear programming (Q912758) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- Orthogonalizing linear operators in convex programming. I, II (Q1280891) (← links)
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday) (Q1592008) (← links)
- Optimization of computations (Q1905130) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- Unified representation of the classical ellipsoid method (Q6066038) (← links)