Finite -subgradient algorithm for approximate solution of the parametric programming problem

DOI10.1007/BF01127783MaRDI QIDQ684974zbMATH OpenOpenAlexFDO

Authors S. K. Zavriev

Publication date 16 September 1993

Published in Computational Mathematics and Modeling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01127783

zbMATH Keywords

approximate solutionconvergencefinite \(\varepsilon\)-subgradient algorithmunconstrained parametric optimization

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31)

Review text

See the review in Zbl 0713.90082.

Recommendations

• scientific article; zbMATH DE number 4174692
• \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems
• An approximation algorithm for a general class of parametric optimization problems
• A certain algorithm for the \(\epsilon\)-subgradient minimization method and its application
• Subgradient projection algorithms and approximate solutions of convex feasibility problems
• An efficient, strongly polynomial, -approximation parametric optimization scheme
• Approximating parameterized convex optimization problems
• Approximating parameterized convex optimization problems
• An optimal method of constructing an -subgradient
• On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems

Cited in

(3)

• An efficient, strongly polynomial, -approximation parametric optimization scheme
• scientific article; zbMATH DE number 4216030 (Why is no real title available?)
• scientific article; zbMATH DE number 3978823 (Why is no real title available?)

This page was built for publication: Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q684974)