An improved subgradient method for constrained nondifferentiable optimization
From MaRDI portal
Recommendations
- A subgradient method for unconstrained nonconvex nonsmooth optimization
- An interior-point based subgradient method for nondifferentiable convex optimization
- Subgradient method for nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 727769
- scientific article; zbMATH DE number 2221956
- An inexact modified subgradient algorithm for nonconvex optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Incremental subgradient methods for nondifferentiable optimization
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- scientific article; zbMATH DE number 62479
Cites work
- scientific article; zbMATH DE number 3528040 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Minimization of unsmooth functionals
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- Two-direction subgradient method for non-differentiable optimization problems
- Validation of subgradient optimization
- Variable target value subgradient method
Cited in
(13)- An inexact modified subgradient algorithm for nonconvex optimization
- An interior-point based subgradient method for nondifferentiable convex optimization
- Method of conjugate subgradients with constrained memory
- Lagrangean/surrogate relaxation for generalized assignment problems
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- On Poljak's improved subgradient method
- The subdifferential descent method in a nonsmooth variational problem
- Subgradient method with entropic projections for convex nondifferentiable minimization
- On global subdifferentials with applications in nonsmooth optimization
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- A variable target value method for nondifferentiable optimization
This page was built for publication: An improved subgradient method for constrained nondifferentiable optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1317025)
