Some remarks on the construction of higher order algorithms in convex optimization
From MaRDI portal
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 3619635 (Why is no real title available?)
- scientific article; zbMATH DE number 3378720 (Why is no real title available?)
- Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
Cited in
(9)- Optimization with nonsmooth data
- A constraint linearization method for nondifferentiable convex minimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Limiting behavior of the approximate second-order subdifferential of a convex function
- Sensitivity analysis of the gratest eigenvalue of a symmetric matrix via the \(\epsilon\)-subdifferential of the associated convex quadratic form
- On connections between approximate second-order directional derivative and second-order Dini derivative for convex functions
- On the representation of approximate subdifferentials for a class of generalized convex functions
- An introduction to the theory of nonsmooth optimization
- Benefit sharing in holding situations
This page was built for publication: Some remarks on the construction of higher order algorithms in convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595339)
