Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems

DOI10.1023/A:1004695229456zbMath1003.49018OpenAlexW1443386821MaRDI QIDQ1594871

S. Bolintineanu

Publication date: 30 July 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004695229456

zbMATH Keywords

vector optimizationconvexityminimizing sequencessemicontinuityconvex analysisweakly efficient sequences

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items (16)

Pareto Optimizing and Kuhn–Tucker Stationary Sequences ⋮ Semivectorial bilevel optimization problem: penalty approach ⋮ Approximate proximal methods in vector optimization ⋮ Generalized Proximal Method for Efficient Solutions in Vector Optimization ⋮ Inertial forward–backward methods for solving vector optimization problems ⋮ Optimality conditions in quasidifferentiable vector optimization ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ An interior proximal method in vector optimization ⋮ A new notion of semicontinuity of vector functions and its properties ⋮ A subgradient-like algorithm for solving vector convex inequalities ⋮ First and second-order Lagrange claims for set-valued maps ⋮ Parametric vector optimization ⋮ Tikhonov-type regularization method for efficient solutions in vector optimization ⋮ A linear scalarization proximal point method for quasiconvex multiobjective minimization ⋮ Extragradient method with Bregman distances for solving vector quasi-equilibrium problems

Cites Work

• Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions
• Compact nets, filters, and relations
• \(\epsilon\)-solutions in vector minimization problems
• Theory of multiobjective optimization
• Conjugate convex operators
• A survey of vector optimization in infinite-dimensional spaces. II
• Well behaved asymptotical convex functions
• Approximation in multiobjective optimization
• Pareto optimizing and scalarly stationary sequences
• How to deal with the unbounded in optimization: Theory and algorithms
• Error bounds in mathematical programming
• Optimization and nonsmooth analysis
• Minimizing and Stationary Sequences of Constrained Optimization Problems
• Convex Functions with Unbounded Level Sets and Applications to Duality Theory
• Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems