Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
From MaRDI portal
Publication:3771978
DOI10.1007/BF01074717zbMATH Open0633.90063OpenAlexW2051654987WikidataQ57498657 ScholiaQ57498657MaRDI QIDQ3771978FDOQ3771978
Authors: Sergei V. Rzhevskii, Alexei V. Kuntsevich
Publication date: 1985
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01074717
Recommendations
- Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
- Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
- Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality
- \(\epsilon\)-subgradient method for the solution of nonlinear extremal problems
- Primal-dual subgradient methods for convex problems
- A primal-dual approach to inexact subgradient methods
- Publication:3199206
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- A certain algorithm for the \(\epsilon\)-subgradient minimization method and its application
Cites Work
Cited In (3)
- Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
- Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
- Epsilon-subgradient optimization techniques in convex programming and Lagrangian duality
This page was built for publication: Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771978)