Some remarks on the construction of higher order algorithms in convex optimization

DOI10.1007/BF01448379zbMATH Open0527.65042OpenAlexW2070461378MaRDI QIDQ595339FDOQ595339

J. Zowe, Claude Lemaréchal

Publication date: 1983

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01448379

zbMATH Keywords

convex optimizationNewton-like methodhigher order algorithmsTaylor development

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Limiting behaviour of the approximate first order and second order directional derivatives for a convex function

Cited In (9)

• Optimization with nonsmooth data
• Benefit sharing in holding situations
• A successive quadratic programming method for a class of constrained nonsmooth optimization problems
• A constraint linearization method for nondifferentiable convex minimization
• 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 the representation of approximate subdifferentials for a class of generalized convex functions
• On connections between approximate second-order directional derivative and second-order Dini derivative for convex functions
• An introduction to the theory of nonsmooth optimization

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)