Exploiting known structures to approximate normal cones

DOI10.1287/MOOR.2013.0590MaRDI QIDQ5169684zbMATH OpenOpenAlexFDO

Authors Chad Tyler Davis, Warren L. Hare

Publication date 11 July 2014

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2013.0590

zbMATH Keywords

constraint setdiscrete approximate gradientnonsmooth optimizationnormal conenumerical analysisoracle functions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Discrete approximations in optimal control (49M25) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Local cone approximations in optimization
• A survey of conical approximations used in the optimization
• On estimating the regular normal cone to constraint systems and stationarity conditions
• A comparative study of various notions of approximation of sets
• Formulas and applications for the normal cone to the solution set of an infinite convex inequality system with a constraint

Cited in

(3)

• Smooth and discrete cone-nets
• Derivative-free optimization methods
• Black-box optimization for the design of a jet plate for impingement cooling

This page was built for publication: Exploiting known structures to approximate normal cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5169684)