The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems

DOI10.1016/J.AMC.2012.02.056zbMath1245.90113OpenAlexW1970495998MaRDI QIDQ440840

Tadeusz Antczak

Publication date: 19 August 2012

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.02.056

zbMATH Keywords

multiobjective programmingconvex function(Weak) Pareto optimal pointpenalized vector optimization problemvector exact \(l_{1}\) penalty function

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items (5)

The Exactness Property of the Vector Exact l₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming ⋮ Vector exponential penalty function method for nondifferentiable multiobjective programming problems ⋮ Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints ⋮ A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems ⋮ Relationship Between β-Efficient Solution and Minimum Risk Efficient Solution for Uncertain Multi-objective Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enlarging the region of convergence of Newton's method for constrained optimization
• Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space
• Optimality conditions for vector mathematical programming via a theorem of the alternative
• An \(\eta\)-approximation method in nonlinear vector optimization
• Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems
• Scalarization in vector optimization
• Exact penalty functions and stability in locally Lipschitz programming
• Nonsmooth multiobjective programming
• Exact penalty functions in nonlinear programming
• On conditions for optimality of the nonlinearl 1 problem
• A lower bound for the controlling parameters of the exact penalty functions
• An exact penalty function for nonlinear programming with inequalities
• Exact Penalty Functions in Constrained Optimization
• Sufficiency of Exact Penalty Minimization
• Non-Linear Programming Via Penalty Functions
• An Exact Potential Method for Constrained Maxima
• Exact penalty functions in nonlinear programming

This page was built for publication: The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems