scientific article; zbMATH DE number 3847230

MaRDI QIDQ3316972zbMATH OpenFDO

Authors P. Kanniappan

Publication date 1984

zbMATH Keywords

469.90088convex programming without constraint qualificationduality theoremsfinite dimensional rangeoptimality conditionpositively homogeneous, lower-semi-continuous, convex functionsubdifferentiable convex functionsum-type objective function

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Convex programming (90C25) Nonlinear programming (90C30) Programming in abstract spaces (90C48) Methods of successive quadratic programming type (90C55)

Recommendations

• scientific article; zbMATH DE number 3934789
• Duality for generalized convex multiobjective programming without a constraint qualification
• scientific article; zbMATH DE number 12754
• Strong duality for standard convex programs
• Duality without constraint qualification for multiobjective programming

Cited in

(19)

• Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
• A unified approach to duality in convex programming
• Existence of optimal solutions and duality results under weak conditions
• Algebraic approach to duality in optimization and applications
• Strong duality for standard convex programs
• Duality theorems for separable convex programming without qualifications
• scientific article; zbMATH DE number 3934789 (Why is no real title available?)
• scientific article; zbMATH DE number 3939125 (Why is no real title available?)
• scientific article; zbMATH DE number 3970543 (Why is no real title available?)
• scientific article; zbMATH DE number 12754 (Why is no real title available?)
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• scientific article; zbMATH DE number 1552795 (Why is no real title available?)
• Optimality and duality without a constraint qualification for minimax programming
• scientific article; zbMATH DE number 762954 (Why is no real title available?)
• Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization
• Duality-based single-level reformulations of bilevel optimization problems
• Limiting Lagrangians: A primal approach
• Some convex programs without a duality gap
• Wolfe duality and Mond-Weir duality via perturbations

This page was built for publication:

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