Pages that link to "Item:Q1099787"
From MaRDI portal
The following pages link to A constraint linearization method for nondifferentiable convex minimization (Q1099787):
Displaying 12 items.
- A variable metric method for nonsmooth convex constrained optimization (Q865537) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- A filter-variable-metric method for nonsmooth convex constrained optimization (Q1004165) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- An algorithm for calculating one subgradient of a convex function of two variables (Q1119340) (← links)
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems (Q1174457) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (Q2786335) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
