Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem
type: Item
instance of: scholarly article
title: Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem
zbMATH Open document ID: 0780.90095
DOI: 10.1007/BF01127783
author: S. K. Zavriev
published in: Computational Mathematics and Modeling
publication date: 1993-09-16T00:00:00Z
review text: See the review in Zbl 0713.90082.
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 416607
zbMATH Keywords: unconstrained parametric optimization
zbMATH Keywords: finite \(\varepsilon\)-subgradient algorithm
zbMATH Keywords: approximate solution
zbMATH Keywords: convergence
MaRDI profile type: Publication
cites work: Q3815850
cites work: Q3783836
full work available at URL: https://doi.org/10.1007/bf01127783
OpenAlex ID: W2082790600
Recommended article: Q3199206
Recommended article: \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems
Recommended article: An approximation algorithm for a general class of parametric optimization problems
Recommended article: A certain algorithm for the \(\epsilon\)-subgradient minimization method and its application
Recommended article: Subgradient projection algorithms and approximate solutions of convex feasibility problems
Recommended article: An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme
Recommended article: Approximating Parameterized Convex Optimization Problems
Recommended article: Approximating parameterized convex optimization problems
Recommended article: An optimal method of constructing an \(\varepsilon\)-subgradient
Recommended article: On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
description: scientific article; zbMATH DE number 416607