Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
From MaRDI portal
Recommendations
- Approximate optimality and approximate duality in nonsmooth composite vector optimization
- scientific article; zbMATH DE number 6508503
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Approximate solutions of multiobjective optimization problems
Cites work
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- -optimality conditions for composed convex optimization problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- A new notion of quasi efficiency in vector optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- An Extended Extremal Principle with Applications to Multiobjective Optimization
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- Approximate solutions of multiobjective optimization problems
- Approximate solutions of vector optimization problems via improvement sets in real linear spaces
- Cone characterizations of approximate solutions in real vector optimization
- Convex vector functions and their subdifferential
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- scientific article; zbMATH DE number 4175838 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- Lagrange multiplier rules for approximate solutions in vector optimization
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Multicriteria Optimization
- On efficient applications of \(G\)-Karush-Kuhn-Tucker necessary optimality theorems to multiobjective programming problems
- Optimality and duality in nonsmooth conic vector optimization
- OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION
- Optimality conditions and duality in nonsmooth multiobjective optimization problems
- Optimality conditions for quasi-solutions of vector optimization problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- Optimality conditions via scalarization for a new \(\epsilon \)-efficiency concept in vector optimization problems
- Robust Optimality and Duality in Multiobjective Optimization Problems under Data Uncertainty
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- Theory of multiobjective optimization
- Variational Analysis
- Variational analysis and applications
- Vector equilibrium problem and vector optimization
Cited in
(15)- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- Modified objective function method in nonsmooth vector optimization over cones
- Approximate solutions of multiobjective optimization problems
- Approximate optimality and approximate duality in nonsmooth composite vector optimization
- On Approximate Solutions in Convex Vector Optimization
- On AKKT optimality conditions for cone-constrained vector optimization problems
- scientific article; zbMATH DE number 7620762 (Why is no real title available?)
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms
- Approximate solutions for robust multiobjective optimization programming in Asplund spaces
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
- On Chankong-Haimes scheme for approximate optimality conditions of nonsmooth fractional multiobjective optimization problems with infinite constraints
- Extended well-posedness of constrained set optimization problems
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
This page was built for publication: Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2150766)
