Characterization of approximate solutions of vector optimization problems with a variable order structure
From MaRDI portal
Publication:467457
DOI10.1007/s10957-014-0535-5zbMath1308.65098OpenAlexW1966160458MaRDI QIDQ467457
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0535-5
algorithmvector optimizationapproximate solutionsEkeland's variational principlevariable-order structure
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Programming in abstract spaces (90C48)
Related Items (20)
Continuity of a scalarization in vector optimization with variable ordering structures and application to convergence of minimal solutions ⋮ Optimality characterizations for approximate nondominated and Fermat rules for nondominated solutions ⋮ Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ Approximate efficiency in set-valued optimization with variable order ⋮ A first bibliography on set and vector optimization problems with respect to variable domination structures ⋮ A Newton-like method for variable order vector optimization problems ⋮ Lagrange multiplier rules for weak approximate Pareto solutions to constrained vector optimization problems with variable ordering structures ⋮ Vector optimization with domination structures: variational principles and applications ⋮ Approximate properly solutions of constrained vector optimization with variable coradiant sets ⋮ A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures ⋮ An ε-Minimax Theorem for Bi-Lower-Semicontinuous Set-Valued Mappings ⋮ Concepts for approximate solutions of vector optimization problems with variable order structures ⋮ Coradiant-valued maps and approximate solutions in variable ordering structures ⋮ Set approach for set optimization with variable ordering structures. I: Set relations and relationship to vector approach ⋮ Construction of functions with uniform sublevel sets ⋮ Hartley properly and super nondominated solutions in vector optimization with a variable ordering structure ⋮ Characterization of properly optimal elements with variable ordering structures ⋮ Two Set Scalarizations Based on the Oriented Distance with Variable Ordering Structures: Properties and Application to Set Optimization ⋮ Second-order characterizations for set-valued equilibrium problems with variable ordering structures ⋮ Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concepts for approximate solutions of vector optimization problems with variable order structures
- Nonconvex separation theorems and some applications in vector optimization
- Optimal elements in vector optimization with a variable ordering structure
- Applied functional analysis. Motivations and methods for mathematicians and economists
- Relative Pareto minimizers for multiobjective problems: Existence and optimality conditions
- Nuclear and full nuclear cones in product spaces: Pareto efficiency and an Ekeland type variational principle
- Ekeland's principle for vector equilibrium problems
- Variable preference modeling with ideal-symmetric convex cones
- Vector variational principle
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- Ekeland's \(\varepsilon\)-variational principle for set-valued mappings
- Equivalents of an approximate variational principle for vector-valued functions and applications
- Existence of solutions for a vector variational inequality: An extension of the Hartmann-Stampacchia theorem
- Stability results for approximately efficient solutions
- Existence and continuity of solutions for vector optimization
- Variational methods in partially ordered spaces
- Some variants of the Ekeland variational principle for a set-valued map
- Scalarizing vector optimization problems
- A conic scalarization method in multi-objective optimization
- Vector complementarity problems with a variable ordering relation
- Vector optimization. Set-valued and variational analysis.
- A nonlinear scalarization function and generalized quasi-vector equilibrium problems
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Adaptive Scalarization Methods in Multiobjective Optimization
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- A Set-Valued Ekeland's Variational Principle in Vector Optimization
- Nonconvex minimization problems
- A generalization of ekellandz’s variational principle
- A nonconvex vector minimization problem
- Variable Ordering Structures in Vector Optimization
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Characterizations of variable domination structures via nonlinear scalarization
This page was built for publication: Characterization of approximate solutions of vector optimization problems with a variable order structure
