Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
From MaRDI portal
(Redirected from Publication:778155)
optimality conditionssemi-infinite vector optimizationClarke subdifferentialapproximate Pareto solutionsinfinite vector optimization
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)
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.
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
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 3634008 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- ϵ-Efficient solutions in semi-infinite multiobjective optimization
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Approximate solutions of multiobjective optimization problems
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- Convergence of the relative Pareto efficient sets
- Ekeland's variational principle and its equivalent theorems in vector optimization
- Existence theorems in vector optimization
- Existence theorems in vector optimization with generalized order
- Necessary conditions for ε-optimality
- New Farkas-type constraint qualifications in convex infinite programming
- Nonsmooth semi-infinite multiobjective optimization problems
- Nonsmooth semi-infinite programming problem using limiting subdifferentials
- On optimality conditions in nondifferentiable programming
- On the existence of Pareto solutions for polynomial vector optimization problems
- On the variational principle
- Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
- Optimality conditions for non-smooth semi-infinite programming
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Optimization and nonsmooth analysis
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Quasi-Slater and Farkas-Minkowski qualifications for semi-infinite programming with applications
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite multiobjective programming with generalized invexity
- Semidefinite Optimization and Convex Algebraic Geometry
- Stability of semi-infinite vector optimization problems under functional perturbations
- Subdifferentials of marginal functions in semi-infinite programming
- Variants of the Ekeland variational principle for a set-valued map involving the Clarke normal cone
- Variational analysis in semi-infinite and infinite programming. I: Stability of linear inequality systems of feasible solutions
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
Cited in
(23)- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces
- Approximate optimality conditions for nonsmooth optimization problems
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- Inexact proximal point algorithm for multiobjective optimization
- Hadamard well-posedness for a set optimization problem with an infinite number of constraints
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- Existence of Pareto solutions for vector polynomial optimization problems with constraints
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Optimality Conditions for Approximate Solutions of Nonsmooth Semi-Infinite Vector Optimization Problems
- scientific article; zbMATH DE number 1516243 (Why is no real title available?)
- Pareto optimization in infinite dimensional spaces: The importance of nuclear cones
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- On Minimax Fractional Semi-Infinite Programming Problems with Applications
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- An infeasibility certificate for nonlinear programming based on Pareto criticality condition
- A note on approximate proper efficiency in linear fractional vector optimization
- 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 solutions of interval-valued optimization problems
- On approximate quasi Pareto solutions in nonsmooth semi-infinite interval-valued vector optimization problems
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)
