Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints

DOI10.1007/S40306-019-00358-XzbMATH Open1473.90153arXiv1808.10100OpenAlexW2996507251WikidataQ126559619 ScholiaQ126559619MaRDI QIDQ778155FDOQ778155

Authors: T. Q. Son, Nguyen Van Tuyen, Ching-Feng Wen 

Publication date: 1 July 2020

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

Abstract: In this paper, we present some new necessary and sufficient optimality conditions in terms of the Clarke subdifferentials for approximate Pareto solutions of a nonsmooth vector optimization problem which has an infinite number of constraints. As a consequence, we obtain optimality conditions for the particular cases of cone-constrained convex vector optimization problems and semidefinite vector optimization problems. Examples are given to illustrate the obtained results.

Full work available at URL: https://arxiv.org/abs/1808.10100

Recommendations

• Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
• Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems
• Optimality conditions using approximations for nonsmooth vector optimization problems under general inequality constraints
• Publication:4509043
• Optimality Conditions for Approximate Pareto Minimality

zbMATH Keywords

optimality conditionssemi-infinite vector optimizationClarke subdifferentialapproximate Pareto solutionsinfinite vector optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Semi-infinite programming (90C34)

Cites Work

• Stability of semi-infinite vector optimization problems under functional perturbations
• Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
• On the variational principle
• Optimization and nonsmooth analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\epsilon\)-solutions in vector minimization problems
• Approximate solutions of multiobjective optimization problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semidefinite Optimization and Convex Algebraic Geometry
• Optimality conditions for non-smooth semi-infinite programming
• Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
• Nonsmooth semi-infinite multiobjective optimization problems
• Semi-infinite multiobjective programming with generalized invexity
• Quasi-Slater and Farkas--Minkowski Qualifications for Semi-infinite Programming with Applications
• New Farkas-type constraint qualifications in convex infinite programming
• Existence theorems in vector optimization
• Necessary conditions for ε-optimality
• On optimality conditions in nondifferentiable programming
• Subdifferentials of marginal functions in semi-infinite programming
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
• Ekeland's variational principle and its equivalent theorems in vector optimization
• Nonsmooth semi-infinite programming problem using limiting subdifferentials
• Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
• Existence theorems in vector optimization with generalized order
• Convergence of the relative Pareto efficient sets
• Variants of the Ekeland variational principle for a set-valued map involving the Clarke normal cone
• Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
• Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
• On the existence of Pareto solutions for polynomial vector optimization problems
• ϵ-Efficient solutions in semi-infinite multiobjective optimization

Cited In (21)

• Some characterizations of approximate solutions for robust semi-infinite optimization problems
• Title not available (Why is that?)
• Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
• Pareto optimization in infinite dimensional spaces: The importance of nuclear cones
• Title not available (Why is that?)
• On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
• Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
• Approximate solutions of interval-valued optimization problems
• Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
• Approximate optimal solutions for multiobjective optimization problems with infinite constraints
• An infeasibility certificate for nonlinear programming based on Pareto criticality condition
• A note on approximate proper efficiency in linear fractional vector optimization
• Hadamard well-posedness for a set optimization problem with an infinite number of constraints
• Approximate optimality conditions for nonsmooth optimization problems
• Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems
• On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
• On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
• Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
• An approach to characterizing \(\epsilon\)-solution sets of convex programs
• On Minimax Fractional Semi-Infinite Programming Problems with Applications
• On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data

This page was built for publication: Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints

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