A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces

DOI10.1016/J.CAM.2024.115860MaRDI QIDQ6567285zbMATH OpenFDO

Authors Nisha Pokharna, Indira P. Tripathi

Publication date 4 July 2024

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

optimalitydualityblind equalizationcomplex programming\(\mathcal{F}\)-convexity

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimality and duality for multi-objective fractional programming in complex spaces
• A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
• Optimality and duality for complex multi-objective programming
• Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality
• Optimality of a class of generalized convex multi-objective fractional programming approximate weak efficient solutions

Cites work

• scientific article; zbMATH DE number 3880459 (Why is no real title available?)
• scientific article; zbMATH DE number 3657457 (Why is no real title available?)
• scientific article; zbMATH DE number 3698748 (Why is no real title available?)
• scientific article; zbMATH DE number 3332083 (Why is no real title available?)
• scientific article; zbMATH DE number 2220068 (Why is no real title available?)
• A new approach to multiobjective programming with a modified objective function
• Characterizing Convexity of Images for Quadratic-Linear Mappings with Applications in Nonconvex Quadratic Optimization
• Characterizing a class of robust vector polynomial optimization via sum of squares conditions
• Complex fractional programming and the Charnes-Cooper transformation
• Criteria of saddle points for the general form of vector optimization problem in complex space
• Duality for nonlinear programming in complex space
• Duality with generalized convexity
• Efficiency for a generalized form of vector optimization problems in complex space
• Further Generalizations of Convexity in Mathematical Programming
• GeneralizedF-convexity and its classification
• Linear programming in complex space
• Modified objective function method in nonsmooth vector optimization over cones
• Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications
• Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
• On nonlinear programming in complex spaces
• On symmetric duality in mathematical programming withF-convexity
• Optimality and duality for complex multi-objective programming
• Optimality and duality for multi-objective fractional programming in complex spaces
• Phase recovery, MaxCut and complex semidefinite programming
• Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
• Some characterizations of robust optimal solutions for uncertain convex optimization problems
• Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
• Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
• The modified objective function method for univex multiobjective variational problems

This page was built for publication: A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces

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