Pages that link to "Item:Q4946704"
From MaRDI portal
The following pages link to An interior-point based subgradient method for nondifferentiable convex optimization (Q4946704):
Displaying 12 items.
- Method of conjugate subgradients with constrained memory (Q463369) (← links)
- Barrier subgradient method (Q633113) (← links)
- On embedding the volume algorithm in a variable target value method. (Q703259) (← links)
- Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
- An improved subgradient method for constrained nondifferentiable optimization (Q1317025) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- The interior point method for nondifferentiable optimization (Q1913067) (← links)
- A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
- A variable target value method for nondifferentiable optimization (Q1970420) (← links)
- A subgradient method with non-monotone line search (Q2696908) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- A reduced subgradient algorithm (Q3026768) (← links)