Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
type: Item
instance of: scholarly article
title: Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
zbMATH Open document ID: 1386.49045
published in: Journal of Optimization Theory and Applications
publication date: 2018-03-22T00:00:00Z
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6852054
zbMATH Keywords: interval-valued optimization problem
zbMATH Keywords: exact absolute value penalty function method
zbMATH Keywords: penalized optimization problem with the interval-valued exact absolute value penalty function
zbMATH Keywords: exactness of the exact absolute value penalty function method
zbMATH Keywords: LU-convex function
author: Tadeusz Antczak
describes a project that uses: PLCP
MaRDI profile type: Publication
full work available at URL: s10957-017-1204-2
OpenAlex ID: W2777825746
cites work: The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
cites work: Wolfe duality for interval-valued optimization
cites work: On interval-valued optimization problems with generalized invex functions
cites work: On sufficiency and duality for a class of interval-valued programming problems
cites work: Nonsmooth interval-valued optimization and saddle-point optimality criteria
cites work: Optimality conditions and duality in nondifferentiable interval-valued programming
cites work: Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
cites work: Optimality Condition and Mixed Duality for Interval-Valued Optimization
cites work: Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
cites work: Multiobjective programming in optimization of the interval objective function
cites work: Multiobjective programming in optimization of interval objective functions -- a generalized approach
cites work: A nonlinear interval number programming method for uncertain optimization problems
cites work: Linear programming with interval right hand sides
cites work: Optimal value bounds in nonlinear programming with interval data
cites work: Optimality conditions of type KKT for optimization problem with interval-valued objective function via generalized derivative
cites work: An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming
cites work: Q5538312
cites work: Non-Linear Programming Via Penalty Functions
cites work: Exact penalty functions method for mathematical programming problems involving invex functions
cites work: The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
cites work: Nonlinear Programming
cites work: Q3690580
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: A lower bound for the controlling parameters of the exact penalty functions
cites work: Exact Penalty Functions in Constrained Optimization
cites work: An exact penalty function for nonlinear programming with inequalities
cites work: Q4226179
cites work: Sufficiency of Exact Penalty Minimization
cites work: Automatic decrease of the penalty parameter in exact penalty function methods
cites work: Q5491447
cites work: Q3994363
cites work: An exact \(l_1\) penalty approach for interval-valued programming problem
cites work: Q3345690
cites work: Convex Analysis
cites work: Optimization and nonsmooth analysis
cites work: Q3760254
DOI: 10.1007/S10957-017-1204-2
Recommended article: Q5038897
Recommended article: Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
Recommended article: The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
Recommended article: An exact penalty function method with global convergence properties for nonlinear programming problems
Recommended article: An exact \(l_1\) penalty approach for interval-valued programming problem
Recommended article: Q3972960
Recommended article: Exact penalty functions in problems of nonsmooth optimization
Recommended article: Q3840141
Recommended article: Q4278922
Recommended article: The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
description: scientific article; zbMATH DE number 6852054