The following pages link to (Q5585890):
Displaying 16 items.
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II (Q1347145) (← links)
- About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I (Q1347165) (← links)
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday) (Q1592008) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- The Newton Bracketing Method for Convex Minimization: Convergence Analysis (Q2897275) (← links)
- Nonsmooth Optimization (Q3569504) (← links)
- A Primal Approach to the Simple Plant Location Problem (Q3958238) (← links)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
- Subgradient method with feasible inexact projections for constrained convex optimization problems (Q5045169) (← links)
- Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks (Q5391886) (← links)
- Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces (Q6140912) (← links)
- Adaptive subgradient methods for mathematical programming problems with quasiconvex functions (Q6154812) (← links)
