A variant of the constrained gradient method

DOI10.1007/BF01098003zbMATH Open0696.90047MaRDI QIDQ911461FDOQ911461

Igor Yaroslavich Zabotin, E. V. Lyamin

Publication date: 1988

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/198159

Recommendations

• The method of conditional minimization with parametric assignment of appropriate directions
• Method of conditional ?-subgradient for solving convex programming problems
• scientific article; zbMATH DE number 2210665
• A version of the parameterized method of centers
• A subgradient selection method for minimizing convex functions subject to linear constraints

zbMATH Keywords

convergenceinequality constraintsconditional gradientsconvex differentiable functional

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of reduced gradient type (90C52)

Cites Work

• Iterative regularization of one version of the conditional-gradient method

Cited In (8)

• A conditional gradient method with linear rate of convergence for solving convex linear systems
• Optimality of two-parameter iterative processes in the constrained gradient method
• Minimization of a non-smooth, strongly quasi-convex function by a conditional gradient type method
• A gradient projection method on an embedding of the feasible set
• Title not available (Why is that?)
• A finite method to find a point in a set defined by a convex differentiable functional
• Affine Invariant Convergence Rates of the Conditional Gradient Method
• Algorithms with active gradients combining for search of conditional minimax

This page was built for publication: A variant of the constrained gradient method

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