A subgradient duality theorem in complex space

MaRDI QIDQ1057783zbMATH OpenFDO

Authors Neelam Datta

Publication date 1984

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

complex spacenondifferentiable programmingsubgradient duality theorem

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15) Nonlinear programming (90C30) Programming in abstract spaces (90C48)

Review text

Recently \textit{M. Schechter} [J. Math. Anal. Appl. 61, 850-855 (1977; Zbl 0369.90104)] has extended a duality theorem of Wolfe from nonlinear differentiable programming to the non-differentiable case in real space, by replacing gradients by subgradients and making use of the generalized Kuhn-Tucker theorem given by \textit{R. T. Rockafellar} [Convex analysis (1970; Zbl 0193.184)]. He has further simplified the dual pair in which non-differentiability enters only in the objective functions. Our purpose is to extend the above theory of Schechter to the complex space.

Recommendations

• scientific article; zbMATH DE number 3965847
• scientific article; zbMATH DE number 3877862
• scientific article; zbMATH DE number 3941274
• Duality for nondifferentiable minimax programming in complex spaces
• Duality for a class of nondifferentiable mathematical programming problems in complex space

Cited in

(2)

• A solution to the Cauchy dual subnormality problem for 2-isometries
• Dualization of subgradient conditions for optimality

This page was built for publication: A subgradient duality theorem in complex space

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