Optimization with nonsmooth data
From MaRDI portal
We discuss where nonsmooth problems arise and why classical methods must fail in a nonsmooth context. Following this we present the main features of the two most successful approaches to nonsmooth problems, namely, the Subgradient methods and the Bundle methods.
Recommendations
Cites work
- A Simplex Method for Function Minimization
- An introduction to the theory of nonsmooth optimization
- Approximation to a set-valued mapping. I: A proposal
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3930735 (Why is no real title available?)
- scientific article; zbMATH DE number 3634029 (Why is no real title available?)
- Methods of descent for nondifferentiable optimization
- Some remarks on the construction of higher order algorithms in convex optimization
Cited in
(9)- A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
- Robust optimization for non-linear impact of data variation
- On parametric nonlinear programming
- Comparing different nonsmooth minimization methods and software
- Matching problems with generalized upper bound side constraints
- scientific article; zbMATH DE number 4030850 (Why is no real title available?)
- scientific article; zbMATH DE number 1217580 (Why is no real title available?)
- Study on subproblem of bundle method for telecommunication network optimization problem
- A non‐smooth lower bound on ν
This page was built for publication: Optimization with nonsmooth data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097840)
