Exact l₁ penalty function for nonsmooth multiobjective interval-valued problems.

DOI10.14736/KYB-2024-5-0652MaRDI QIDQ7031132zbMATH OpenFDO

Authors Julie Khatri, Ashish Kumar Prasad

Publication date 6 February 2025

Published in Kybernetika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14736/KYB-2024-5-0652

zbMATH Keywords

exact l\(_1\) penalty functioninterval-valued problemLU-efficient solutionmultiobjective programming

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Numerical methods in optimal control (49M99) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cites work

• \((p,r)\)-invex sets and functions
• A class of nonconvex functions and mathematical programming
• An exact \(l_1\) penalty approach for interval-valued programming problem
• An exact penalty function for nonlinear programming with inequalities
• An Exact Potential Method for Constrained Maxima
• Duality for a fractional variational formulation using \eta-approximated method
• Exact penalty functions method for mathematical programming problems involving invex functions
• Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3281219 (Why is no real title available?)
• Invex functions and constrained local minima
• Invexity of supremum and infimum functions
• Non-Linear Programming Via Penalty Functions
• Nonsmooth invexity
• On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
• On sufficiency and duality for a class of interval-valued programming problems
• On sufficiency of the Kuhn-Tucker conditions
• Optimality condition and mixed duality for interval-valued optimization
• Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
• Optimality conditions and duality results for nonsmooth vector optimization problems with the multiple interval-valued objective function
• Optimization and nonsmooth analysis
• Sufficiency of Exact Penalty Minimization
• The essence of invexity
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
• The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
• The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
• What is invexity?
• Wolfe duality for interval-valued optimization

This page was built for publication: Exact l\(_1\) penalty function for nonsmooth multiobjective interval-valued problems.

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