Converse and symmetric duality in complex nonlinear programming

DOI10.1016/0022-247X(72)90244-2MaRDI QIDQ1214852zbMATH OpenOpenAlexFDO

Authors B. D. Craven, Bertram Mond

Publication date 1972

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(72)90244-2

Mathematics Subject Classification ID

Extremal problems for conformal and quasiconformal mappings, other methods (30C75) Nonlinear programming (90C30)

Cites work

• A duality theorem for complex quadratic programming
• A symmetric dual theorem for non-linear programs
• scientific article; zbMATH DE number 3291743 (Why is no real title available?)
• scientific article; zbMATH DE number 3052220 (Why is no real title available?)
• On duality in complex linear programming
• Projection and restriction methods in geometric programming and related problems
• Symmetric dual nonlinear programs
• Technical Note—On Converse Duality in Nonlinear Programming

Cited in

(8)

• Duality for a class of nondifferentiable mathematical programming problems in complex space
• Nonlinear programming in locally convex spaces
• Solution of the complex linear complementarity problem
• On converse duality in complex nonlinear programming
• Sufficient Fritz John optimality conditions
• Complementarity for arbitrary cones
• Modulus-based matrix splitting methods for complex linear complementarity problem
• Real and complex Fritz John theorems

This page was built for publication: Converse and symmetric duality in complex nonlinear programming

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