Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems

DOI10.1007/s10957-017-1204-2zbMath1386.49045OpenAlexW2777825746MaRDI QIDQ1706415

Tadeusz Antczak

Publication date: 22 March 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1204-2

zbMATH Keywords

exact absolute value penalty function methodexactness of the exact absolute value penalty function methodinterval-valued optimization problemLU-convex functionpenalized optimization problem with the interval-valued exact absolute value penalty function

Mathematics Subject Classification ID

Related Items (8)

On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ A subgradient-based neurodynamic algorithm to constrained nonsmooth nonconvex interval-valued optimization ⋮ Solving invex multitime control problems with first‐order PDE constraints via the absolute value exact penalty method ⋮ Saddle point criteria for multi-dimensional control optimisation problem involving first-order PDE constraints ⋮ New properties of the switching points for the generalized Hukuhara differentiability and some results on calculus ⋮ Optimality conditions for interval-valued univex programming ⋮ Generalized-Hukuhara penalty method for optimization problem with interval-valued functions and its application in interval-valued portfolio optimization problems ⋮ Robust saddle-point criteria for multi-dimensional control optimisation problems with data uncertainty

Uses Software

• PLCP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sufficiency and duality for a class of interval-valued programming problems
• An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming
• Nonsmooth interval-valued optimization and saddle-point optimality criteria
• Optimal value bounds in nonlinear programming with interval data
• Wolfe duality for interval-valued optimization
• Exact penalty functions method for mathematical programming problems involving invex functions
• Multiobjective programming in optimization of interval objective functions -- a generalized approach
• Automatic decrease of the penalty parameter in exact penalty function methods
• Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
• Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
• Optimality conditions and duality in nondifferentiable interval-valued programming
• An exact \(l_1\) penalty approach for interval-valued programming problem
• The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
• On interval-valued optimization problems with generalized invex functions
• A nonlinear interval number programming method for uncertain optimization problems
• Multiobjective programming in optimization of the interval objective function
• Optimality Condition and Mixed Duality for Interval-Valued Optimization
• Linear programming with interval right hand sides
• Optimization and nonsmooth analysis
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• 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
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
• Sufficiency of Exact Penalty Minimization
• Nonlinear Programming
• Non-Linear Programming Via Penalty Functions
• Convex Analysis
• Numerical optimization. Theoretical and practical aspects. Transl. from the French

This page was built for publication: Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems