Approximate convexity in vector optimisation
From MaRDI portal
Publication:3410756
DOI10.1017/S0004972700035656zbMath1133.90013OpenAlexW2129761632MaRDI QIDQ3410756
Davinder Bhatia, Aparna Mehra, Anjana Gupta
Publication date: 16 November 2006
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0004972700035656
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items
On vector variational-like inequalities involving right upper-Dini-derivative functions ⋮ On Minty variational principle for nonsmooth vector optimization problems with approximate convexity ⋮ Nonsmooth multiobjective problems and generalized vector variational inequalities using quasi-efficiency ⋮ Multitime multiobjective variational problems and vector variational-like inequalities ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems ⋮ Vector critical points and generalized quasi-efficient solutions in nonsmooth multi-objective programming ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ On relations between nonsmooth interval-valued multiobjective programming problems and generalized Stampacchia vector variational inequalities ⋮ Optimality via generalized approximate convexity and quasiefficiency ⋮ On Minty variational principle for nonsmooth multiobjective optimization problems on Hadamard manifolds ⋮ Vector variational inequalities on Riemannian manifolds with approximate geodesic star-shaped functions ⋮ Unnamed Item ⋮ Characterization of weakly sharp solutions of a variational-type inequality with convex functional ⋮ Relationships between interval-valued vector optimization problems and vector variational inequalities ⋮ On the Applications of Nonsmooth Vector Optimization Problems to Solve Generalized Vector Variational Inequalities Using Convexificators ⋮ A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data
Cites Work
- On efficiency and duality for multiobjective programs
- Efficiency and generalized convex duality for multiobjective programs
- On incomplete Lagrange function and saddle point optimality criteria in mathematical programming
- Mixed type duality in multiobjective programming problems
- Strong and Weak Convexity of Sets and Functions
- On generalised convex mathematical programming
- Generalized (F, ρ)-convexity and duality for non smooth multi-objective programs
- On mixed duality in mathematical programming.
