scientific article; zbMATH DE number 3868523

zbMATH Open0545.65045MaRDI QIDQ3334893FDOQ3334893

Authors: Jean-Louis Goffin 

Publication date: 1981

Title of this publication is not available (Why is that?)

Recommendations

• A note on the convergence of subgradient optimization methods
• Subgradient projection algorithm. II
• A subgradient selection method for minimizing convex functions subject to linear constraints
• scientific article; zbMATH DE number 4100967
• Publication:3468889

zbMATH Keywords

Convergenceellipsoid algorithmShor-Khacian methodVariable metric subgradient optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Nonlinear programming (90C30)

Cited In (12)

• Title not available (Why is that?)
• On embedding the volume algorithm in a variable target value method.
• Title not available (Why is that?)
• The steepest descent gravitational method for linear programming
• Variable metric relaxation methods, part II: The ellipsoid method
• Convergence and computational analyses for some variable target value and subgradient deflection methods
• Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods
• Title not available (Why is that?)
• On some difficult linear programs coming from set partitioning
• A class of convergent primal-dual subgradient algorithms for decomposable convex programs
• Block-iterative surrogate projection methods for convex feasibility problems
• A note on the convergence of subgradient optimization methods

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 Q3334893)