A subgradient selection method for minimizing convex functions subject to linear constraints
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3750660 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 3793788 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An aggregate subgradient method for nonsmooth convex minimization
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- The Cutting-Plane Method for Solving Convex Programs
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cited in
(10)- A note on the convergence of subgradient optimization methods
- scientific article; zbMATH DE number 3868523 (Why is no real title available?)
- scientific article; zbMATH DE number 62479 (Why is no real title available?)
- A subgradient method with non-monotone line search
- Implementation of a subgradient projection algorithm II
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
- A variant of the constrained gradient method
- scientific article; zbMATH DE number 3894844 (Why is no real title available?)
- scientific article; zbMATH DE number 3995464 (Why is no real title available?)
- The sublinear operator method and selector problems
This page was built for publication: A subgradient selection method for minimizing convex functions subject to linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092621)