A note on multiple optimality conditions for programs with convex inequality constraints

DOI10.1016/0022-247X(90)90376-QzbMATH Open0703.90082OpenAlexW2064690161MaRDI QIDQ916574FDOQ916574

Authors: Godfrey C. Muganda 

Publication date: 1990

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(90)90376-q

Recommendations

• On some specification of the Dubovitskii-Milyutin method
• A simple constraint qualification in convex programming
• scientific article; zbMATH DE number 1383177
• scientific article; zbMATH DE number 4097143
• scientific article; zbMATH DE number 5924846

zbMATH Keywords

locally Lipschitz functionsreal Banach spaceconvex programconvex inequality constraintsmultiple optimality conditionsmultiset necessary and sufficient conditions

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions for problems in abstract spaces (49K27) Programming in abstract spaces (90C48)

Cites Work

• A New Approach to Lagrange Multipliers
• Title not available (Why is that?)
• Characterization of optimality in convex programming without a constraint qualification
• Characterizations of optimality in convex programming: the nondifferentiable case

Cited In (4)

• A class of valid inequalities for multilinear 0-1 optimization problems
• Level-constrained programming
• A necessary and sufficient condition for Altman's maximal element problem for constraint sets with many equalities
• A note on Lagrange multipliers with several binding constraints

This page was built for publication: A note on multiple optimality conditions for programs with convex inequality constraints

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