On characterizing the blunt minimizers of epsilon convex programs

MaRDI QIDQ5177828zbMATH OpenFDO

Authors

Publication date 6 March 2015

Full work available at URL http://www.yokohamapublishers.jp/online2/opjnca/vol16/p321.html

zbMATH Keywords

characterizationssolution setsepsilon convexityepsilon blunt minimizersepsilon monotonicity

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• An approach to characterizing \(\epsilon\)-solution sets of convex programs
• scientific article; zbMATH DE number 7476164
• Epsilon-solutions and epsilon-supports
• scientific article; zbMATH DE number 1421254
• \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions

Cited in

(1)

• On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators

This page was built for publication: On characterizing the blunt minimizers of epsilon convex programs

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