scientific article; zbMATH DE number 3304564
From MaRDI portal
Publication:5585890
zbMath0191.48701MaRDI QIDQ5585890
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
Subgradient method with feasible inexact projections for constrained convex optimization problems ⋮ Efficient algorithms for the capacitated concentrator location problem ⋮ The Newton Bracketing Method for Convex Minimization: Convergence Analysis ⋮ About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II ⋮ About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I ⋮ Computational efficiency of the simplex embedding method in convex nondifferentiable optimization ⋮ Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces ⋮ A dynamic simultaneous algorithm for solving split equality fixed point problems ⋮ Adaptive subgradient methods for mathematical programming problems with quasiconvex functions ⋮ Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks ⋮ Nonsmooth Optimization ⋮ RSG: Beating Subgradient Method without Smoothness and Strong Convexity ⋮ Synthesis of cutting and separating planes in a nonsmooth optimization method ⋮ Plant location with minimum inventory ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday) ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ A Primal Approach to the Simple Plant Location Problem
This page was built for publication:
