Merit functions in vector optimization

DOI10.1007/s10107-008-0208-yzbMath1279.90153OpenAlexW1987546048MaRDI QIDQ1013975

J. Martínez

Publication date: 24 April 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-008-0208-y

Mathematics Subject Classification ID

Sensitivity, stability, well-posedness (49K40) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)

Related Items

Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces ⋮ Relationships between the oriented distance functional and a nonlinear separation functional ⋮ A norm minimization-based convex vector optimization algorithm ⋮ Characterizations of set relations with respect to variable domination structures via oriented distance function ⋮ A set scalarization function and Dini directional derivatives with applications in set optimization problems ⋮ Nonlinear separation in the image space with applications to constrained optimization ⋮ Characterizations of multiobjective robustness via oriented distance function and image space analysis ⋮ A new scheme for approximating the weakly efficient solution set of vector rational optimization problems ⋮ Properties of the nonlinear scalar functional and its applications to vector optimization problems ⋮ Characterizations of multi-objective robustness solutions defined by Minkowski set difference ⋮ Conditional gradient method for vector optimization ⋮ Variational analysis on the signed distance functions ⋮ Vector variational-like inequalities with constraints: separation and alternative ⋮ The global weak sharp minima with explicit exponents in polynomial vector optimization problems ⋮ Slopes, error bounds and weak sharp Pareto minima of a vector-valued map ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization ⋮ An Oriented Distance Function Application to Gap Functions for Vector Variational Inequalities ⋮ Some characterizations of a nonlinear scalarizing function via oriented distance function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved definition of proper efficiency for vector maximization with respect to cones
• A generalization of the Farkas lemma and applications to convex programming
• Optimality conditions for set-valued optimization problems
• Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
• Scalarization of Henig proper efficient points in a normed space
• Multicriteria optimization
• Regularities and their relations to error bounds
• Sequence spaces with a given Köthe \(\beta\)-dual
• Second-order conditions in \(C^{1,1}\) constrained vector optimization
• Error Bounds for Lower Semicontinuous Functions in Normed Spaces
• Scalarization in vector optimization
• A Characterization of Properly Minimal Elements of a Set
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Nonconvex Duality in Multiobjective Optimization
• Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
• Super Efficiency in Vector Optimization
• An Existence Theorem in Vector Optimization
• Variational Analysis
• Approximation of set-valued functions by single-valued one
• Degrees of Efficiency and Degrees of Minimality
• On First- and Second-Order Conditions for Error Bounds
• Optimality Conditions via Norm Scalarization in Vector Optimization
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Weak Sharp Minima in Multicriteria Linear Programming
• A Nonlinear Extension of Hoffman's Error Bounds for Linear Inequalities
• Set-valued analysis

This page was built for publication: Merit functions in vector optimization