Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification

DOI10.1287/OPRE.16.4.849MaRDI QIDQ5548708zbMATH OpenOpenAlexFDO

Authors

Publication date 1968

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.16.4.849

zbMATH Keywords

operations research

Cited in

(4)

• Algorithm model for penalty functions-type iterative pcedures
• Characterization of optimality in convex programming without a constraint qualification
• Karush-Kuhn-Tucker conditions and Lagrangian approach for improving machine learning techniques: a survey and new developments
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization

This page was built for publication: Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification

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