On multiobjective optimization and approximate vector variational inequalities using directional convexificators

DOI10.4310/AMSA.260804064350MaRDI QIDQ7325307zbMATH OpenFDO

Authors Prachi Sachan, Vivek Laha

Publication date 7 September 2026

Published in Annals of Mathematical Sciences and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/AMSA.260804064350

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• \(\varepsilon\)-optimality for multiobjective programming on a Banach space
• A study on vector variational-like inequalities using convexificators and application to its bi-level form
• A survey of recent developments in multiobjective optimization
• An easy path to convex analysis and applications
• Approximate convexity in vector optimisation
• Approximate optimality for quasi approximate solutions in nonsmooth semi-infinite programming problems, using \(\varepsilon\)-upper semi-regular semi-convexificators
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
• Convexifactors, generalized convexity and vector optimization
• First and second order optimality conditions for nonsmooth multiobjective problems with equilibrium constraints
• Generalized Minty vector variational-like inequalities and vector optimization problems
• Necessary and sufficient conditions for efficiency via convexificators
• Necessary and sufficient optimality conditions for fractional multi-objective problems
• Necessary optimality conditions for bilevel optimization problems using convexificators
• Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
• On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators
• On approximately star-shaped functions and approximate vector variational inequalities
• On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
• On nonsmooth V-invexity and vector variational-like inequalities in terms of the Michel-Penot subdifferentials
• On semi-infinite mathematical programming problems with equilibrium constraints using generalized convexity
• On variational inequalities using directional convexificators
• On vector optimization problems and vector variational inequalities using convexificators
• On Wolfe duality for mathematical programs with equilibrium constraints using directional convexificators
• Optimality and duality results for bilevel programming problem using convexifactors
• Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
• Optimality conditions for multiobjective fractional programming, via convexificators
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators
• Optimality conditions for nonsmooth semidefinite programming via convexificators
• Optimality conditions for optimistic bilevel programming problem using convexifactors
• Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem
• Optimality conditions of a set valued optimization problem with the help of directional convexificators
• Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency

This page was built for publication: On multiobjective optimization and approximate vector variational inequalities using directional convexificators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7325307)