Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
DOI10.1023/A:1004695229456zbMATH Open1003.49018OpenAlexW1443386821MaRDI QIDQ1594871FDOQ1594871
Authors: 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
Recommendations
- Approximate convexity in vector optimisation
- scientific article; zbMATH DE number 1664585
- On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
- Existence of weakly efficient solutions in nonsmooth vector optimization
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
convex analysisconvexitysemicontinuityvector optimizationminimizing sequencesweakly efficient sequences
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)
Cites Work
- Convex Analysis
- Theory of multiobjective optimization
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions
- \(\epsilon\)-solutions in vector minimization problems
- Error bounds in mathematical programming
- Stability Results for Ekeland's ε-Variational Principle and Cone Extremal Solutions
- Compact nets, filters, and relations
- Conjugate convex operators
- Well behaved asymptotical convex functions
- How to deal with the unbounded in optimization: Theory and algorithms
- Minimizing and Stationary Sequences of Constrained Optimization Problems
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Title not available (Why is that?)
- Vector variational principles; \(\varepsilon\)-efficiency and scalar stationarity
- A survey of vector optimization in infinite-dimensional spaces. II
- Approximation in multiobjective optimization
- Pareto optimizing and scalarly stationary sequences
- Title not available (Why is that?)
Cited In (18)
- Extragradient method with Bregman distances for solving vector quasi-equilibrium problems
- Generalized proximal method for efficient solutions in vector optimization
- Optimality conditions in quasidifferentiable vector optimization
- A linear scalarization proximal point method for quasiconvex multiobjective minimization
- On the existence of weak efficient solutions of nonconvex vector optimization problems
- An interior proximal method in vector optimization
- A subgradient-like algorithm for solving vector convex inequalities
- Tikhonov-type regularization method for efficient solutions in vector optimization
- A new notion of semicontinuity of vector functions and its properties
- Semivectorial bilevel optimization problem: penalty approach
- Approximate proximal methods in vector optimization
- Pareto Optimizing and Kuhn–Tucker Stationary Sequences
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- First and second-order Lagrange claims for set-valued maps
- Inertial forward–backward methods for solving vector optimization problems
- Parametric vector optimization
- Hybrid approximate proximal method with auxiliary variational inequality for vector optimization
- Vector asymptotic functions and their application to multiobjective optimization problems
This page was built for publication: Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1594871)
