Asymptotical good behavior on inequalities with completely approximate K-T concept

DOI10.1016/j.orl.2011.12.005zbMath1242.90161OpenAlexW1979080243MaRDI QIDQ435757

Mounir El Maghri, Bouchaib Radi

Publication date: 12 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.12.005

zbMATH Keywords

minimizing sequencesunboundednessinfeasibilitypenalty methodsKT sequenceswell-behavedness

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Well behaved asymptotical convex functions
• How to deal with the unbounded in optimization: Theory and algorithms
• Error bounds in mathematical programming
• A note on subdifferentials of convex composite functionals
• A Condition Number for Differentiable Convex Inequalities
• Minimizing and Stationary Sequences of Constrained Optimization Problems
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Extension of Hoffman’s Error Bound to Polynomial Systems

This page was built for publication: Asymptotical good behavior on inequalities with completely approximate K-T concept