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

DOI10.1016/J.ORL.2011.12.005zbMATH Open1242.90161OpenAlexW1979080243MaRDI QIDQ435757FDOQ435757

Authors: 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

Recommendations

• scientific article; zbMATH DE number 5695650
• Asymptotical well behaviour for constrained minimisation problems
• scientific article; zbMATH DE number 4167868
• On the weak convergence of the method of penalty functions with respect to argument
• Minimizing and Stationary Sequences of Constrained Optimization Problems

zbMATH Keywords

penalty methodsminimizing sequencesinfeasibilityKT sequencesunboundednesswell-behavedness

Mathematics Subject Classification ID

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

Cites Work

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

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

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