scientific article; zbMATH DE number 2133301
numerical examplesconvex programmingnonsmooth optimizationtextbookbundle methodstrust-region methodssubgradient methodsapproximate derivativesapproximate descent methods
Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods based on nonlinear programming (49M37) Nonsmooth analysis (49J52) Methods of reduced gradient type (90C52) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
- Numerical Nonsmooth Optimization
- On Lipschitz optimization based on gray-box piecewise linearization
- A semismooth conjugate gradients method – theoretical analysis
- Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms
- Essentials of numerical nonsmooth optimization
- scientific article; zbMATH DE number 49224 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650335)