Convergence properties of a conditional -subgradient method applied to linear programs
DOI10.1007/S10589-005-2178-9zbMATH Open1089.90042OpenAlexW2040567446MaRDI QIDQ812414FDOQ812414
Authors: Sergei V. Rzhevskii
Publication date: 23 January 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-2178-9
Recommendations
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- scientific article; zbMATH DE number 429229
- Method of conditional ?-subgradient for solving convex programming problems
- Publication:4723574
- scientific article; zbMATH DE number 4197761
linear programmingconvex programmingnormal conesubdifferentialdomain\(\varepsilon\)-subdifferentialpolyhedral setsubgradientinfimal convolutiondual problembarrier coneconditions \(\varepsilon\)-subdifferentialconvex (conjugate, recession, affine, polyhedral, support) function
Cites Work
Cited In (4)
- A conditional gradient method with linear rate of convergence for solving convex linear systems
- A hybrid gradient and feasible direction pivotal solution algorithm for general linear programs
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems.
- Method of conditional ?-subgradient for solving convex programming problems
This page was built for publication: Convergence properties of a conditional \(\varepsilon\)-subgradient method applied to linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812414)