A SUFFICIENT MINIMALITY CONDITION FOR CONVEX COMPOSITE FUNCTIONS

DOI10.17654/AM0970230075zbMath1392.49018MaRDI QIDQ4639834

Stefan Hamann

Publication date: 11 May 2018

Published in: Far East Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

sub-differentialsharp minimumconvex composite functionsufficient minimality condition

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Fréchet and Gateaux differentiability in optimization (49J50) Optimality conditions for problems involving relations other than differential equations (49K21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong KKT conditions and weak sharp solutions in convex-composite optimization
• Optimality conditions for non-finite valued convex composite functions
• Second-order global optimality conditions for convex composite optimization
• Convex composite minimization with \(C^{1,1}\) functions
• Epi-convergent Smoothing with Applications to Convex Composite Functions
• Weak Sharp Minima in Mathematical Programming
• A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization

This page was built for publication: A SUFFICIENT MINIMALITY CONDITION FOR CONVEX COMPOSITE FUNCTIONS