Extension to sufficient optimality conditions in complex programming

MaRDI QIDQ5425519zbMATH OpenFDO

Authors

Publication date 14 November 2007

Full work available at URL http://www.scipub.org/scipub/ab_issue.php?pg_no=40-48&j_id=jms2&art_no=9&issue_no=1

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Extension to necessary optimality conditions in complex programming
• scientific article; zbMATH DE number 1343521
• Optimality conditions for minimax programming of analytic functions
• Pseudoconvex complex minimax programming
• Complex minimax programming under generalized convexity

Cited in

(5)

• On nonlinear programming in complex spaces
• Extension to necessary optimality conditions in complex programming
• Optimality and duality for complex multi-objective programming
• Efficiency for a generalized form of vector optimization problems in complex space
• Extended McCormick relaxation rules for handling empty arguments representing infeasibility

This page was built for publication: Extension to sufficient optimality conditions in complex programming

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