The vector exact l₁ penalty method for nondifferentiable convex multiobjective programming problems

DOI10.1016/J.AMC.2012.02.056MaRDI QIDQ440840zbMATH OpenOpenAlexFDO

Authors 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

(Weak) Pareto optimal pointconvex functionmultiobjective programmingpenalized vector optimization problemvector exact \(l_{1}\) penalty function

Mathematics Subject Classification ID

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

Recommendations

• The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
• Vector exponential penalty function method for nondifferentiable multiobjective programming problems
• An exact minimax penalty function method and saddle point criteria for nonsmooth convex vector optimization problems
• scientific article; zbMATH DE number 16307
• THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS

Cites work

• A lower bound for the controlling parameters of the exact penalty functions
• An \(\eta\)-approximation method in nonlinear vector optimization
• An exact penalty function for nonlinear programming with inequalities
• An Exact Potential Method for Constrained Maxima
• Enlarging the region of convergence of Newton's method for constrained optimization
• Exact penalty functions and stability in locally Lipschitz programming
• Exact Penalty Functions in Constrained Optimization
• Exact penalty functions in nonlinear programming
• Exact penalty functions in nonlinear programming
• scientific article; zbMATH DE number 3848989 (Why is no real title available?)
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 41026 (Why is no real title available?)
• scientific article; zbMATH DE number 50640 (Why is no real title available?)
• scientific article; zbMATH DE number 1328995 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems
• Non-Linear Programming Via Penalty Functions
• Nonsmooth multiobjective programming
• On conditions for optimality of the nonlinearl 1 problem
• Optimality conditions for vector mathematical programming via a theorem of the alternative
• Scalarization in vector optimization
• Sufficiency of Exact Penalty Minimization
• Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space

Cited in

(8)

• Vector exponential penalty function method for nondifferentiable multiobjective programming problems
• A new approximation approach to optimality and duality for a class of nonconvex differentiable vector optimization problems
• The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
• An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity
• Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints
• Relationship between -efficient solution and minimum risk efficient solution for uncertain multi-objective problem
• Solving convex uncertain PDE-constrained multi-dimensional fractional control problems via a new approach
• A new approach for solving the multidimensional control optimization problems with first-order partial differential equations constraints

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

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