Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
From MaRDI portal
Publication:4007481
DOI10.1007/BF01068618zbMATH Open0748.90054MaRDI QIDQ4007481FDOQ4007481
Authors: Sergei V. Rzhevskii 
Publication date: 27 September 1992
Published in: Cybernetics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4197761
- Method of conditional ?-subgradient for solving convex programming problems
- An interior-point based subgradient method for nondifferentiable convex optimization
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
- scientific article; zbMATH DE number 429229
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
Cited In (8)
- One limit theorem, optimal criterion and existence theorem of the dual nonlinear program
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Method of conditional ?-subgradient for solving convex programming problems
- Using the ?-subgradient method to solve the dual and the primal mathematical programming problems
- Constrained ?-subgradient method for simultaneous solution of the primal and dual problems of convex programming
This page was built for publication: Conditional ?-subgradient method for simultaneous solution of the primal and the dual convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4007481)
