On Strict Converse Duality In Nonlinear Programming

DOI10.1080/02522667.1985.10698809MaRDI QIDQ3690594zbMATH OpenOpenAlexFDO

Authors Bertram Mond, Richard R Egudo

Publication date 1985

Published in Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02522667.1985.10698809

zbMATH Keywords

strict converse dualityweaker convexity conditions

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15)

Recommendations

• A Note on Strict Converse Duality in Nonlinear Programming
• On various duality theorems in nonlinear programming
• scientific article; zbMATH DE number 59929
• scientific article; zbMATH DE number 3856842
• Converse Duality in Nonlinear Programming

Cites work

• A Strict Converse Duality Theorem in Nonlinear Programming
• Generalized convexity and duality in mathematical programming

Cited in

(8)

• On Converse Duality for Nonsmooth Optimization Problem
• On various duality theorems in nonlinear programming
• On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
• A Note on Strict Converse Duality in Nonlinear Programming
• On strong pseudoconvexity in nonlinear programming duality
• Converse Duality in Nonlinear Programming
• Converse duality in nonlinear programming with cone constraints
• scientific article; zbMATH DE number 6117328 (Why is no real title available?)

This page was built for publication: On Strict Converse Duality In Nonlinear Programming

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