Converse and symmetric duality in complex nonlinear programming

DOI10.1016/0022-247X(72)90244-2zbMath0298.90057OpenAlexW1985390937MaRDI QIDQ1214852

Bruce 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

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

Related Items (8)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Projection and restriction methods in geometric programming and related problems
• Symmetric dual nonlinear programs
• A duality theorem for complex quadratic programming
• On duality in complex linear programming
• A symmetric dual theorem for non-linear programs
• Technical Note—On Converse Duality in Nonlinear Programming

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