scientific article; zbMATH DE number 3304564
From MaRDI portal
Publication:5585890
Cited in
(19)- Zero-one integer programs with few contraints - lower bounding theory
- Efficient algorithms for the capacitated concentrator location problem
- Plant location with minimum inventory
- 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
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- The Newton bracketing method for convex minimization: convergence analysis
- Nonsmooth optimization
- A Primal Approach to the Simple Plant Location Problem
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Performance of some approximate subgradient methods over nonlinearly constrained networks
- 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
- A novel stepsize for gradient descent method
- Stochastic algorithms with geometric step decay converge linearly on sharp functions
- Synthesis of cutting and separating planes in a nonsmooth optimization method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5585890)
