Subgradient projection algorithm. II
From MaRDI portal
Publication:797969
DOI10.1016/0021-9045(84)90098-4zbMATH Open0546.65040OpenAlexW2057473298MaRDI QIDQ797969FDOQ797969
Authors: V. P. Sreedharan
Publication date: 1984
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(84)90098-4
Recommendations
convergencejammingsubgradient projection algorithmnon-differentiable optimizationstrictly convex piecewise smooth function
Cites Work
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sufficient conditions for extremum, penalty functions and regularity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Convergence of Gradient Methods under Constraint
- A subgradient projection algorithm
- Implementation of a subgradient projection algorithm
- Implementation of a subgradient projection algorithm II
Cited In (23)
- Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
- The method of analytic barriers with updating for minimization of a convex function subject to box contraints on the variables.
- Extensions of subgradient projection algorithms
- A subgradient selection method for minimizing convex functions subject to linear constraints
- Title not available (Why is that?)
- \(\epsilon\)-subgradient projection algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower subdifferentiable functions and their minimization by cutting planes
- The gradient projection method with exact line search
- Implementation of a subgradient projection algorithm II
- Title not available (Why is that?)
- Algorithms for optimization problems with exclusion constraints
- A least distance algorithm for a smooth strictly convex norm
- An algorithm for constrained convex optimization
- Subgradient projection algorithms for constrained nonsmooth optimization II: nonlinear constraints†
- Projection method with level control in convex minimization
- Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- On finite convergence and constraint identification of subgradient projection methods
- An algorithm for approximation by elements of a cone in a banach space
- Title not available (Why is that?)
- The method of projective transformations for the minimization problem of a submodular function
This page was built for publication: Subgradient projection algorithm. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797969)