Modified objective function method in nonsmooth vector optimization over cones

DOI10.1007/s11590-013-0661-2zbMath1321.90123OpenAlexW1997609533MaRDI QIDQ2448204

Malti Kapoor, Sunila Sharma, Surjeet Kaur Suneja

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0661-2

zbMATH Keywords

weakly efficient solutionsLagrange functionnonsmooth vector optimizationKKT-conditionscone-invex functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (3)

Higher order strict global minimizers in non-differentiable multiobjective optimization involving higher order invexity and variational inequality ⋮ Second order modified objective function method for twice differentiable vector optimization problems over cone constraints ⋮ A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems

Cites Work

• Multiobjective optimization problems with modified objective functions and cone constraints and applications
• Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
• Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
• A new approach to multiobjective programming with a modified objective function
• Generalized nonsmooth invexity over cones in vector optimization
• An \(\eta\)-approximation method in nonlinear vector optimization
• Optimization and nonsmooth analysis
• On locally Lipschitz vector-valued invex functions

This page was built for publication: Modified objective function method in nonsmooth vector optimization over cones