Pages that link to "Item:Q1317025"
From MaRDI portal
The following pages link to An improved subgradient method for constrained nondifferentiable optimization (Q1317025):
Displaying 12 items.
- Method of conjugate subgradients with constrained memory (Q463369) (← links)
- Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
- On Poljak's improved subgradient method (Q1090617) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- An improved stepsize of the subgradient algorithm for solving the Lagrangian relaxation problem (Q1429768) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- A variable target value method for nondifferentiable optimization (Q1970420) (← links)
- On global subdifferentials with applications in nonsmooth optimization (Q2052399) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- The subdifferential descent method in a nonsmooth variational problem (Q2693790) (← links)
- An interior-point based subgradient method for nondifferentiable convex optimization (Q4946704) (← links)
