The following pages link to Barrier subgradient method (Q633113):
Displaying 8 items.
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- A Subgradient Method for Free Material Design (Q2832891) (← links)
- Multiresolution Parameter Choice Method for Total Variation Regularized Tomography (Q3188212) (← links)
- A Single-Phase, Proximal Path-Following Framework (Q5219702) (← links)
- Convergence rate analysis of the multiplicative gradient method for PET-type problems (Q6161276) (← links)
