On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
DOI10.1080/02331934.2018.1466884zbMATH Open1409.90169OpenAlexW2800481531WikidataQ129817213 ScholiaQ129817213MaRDI QIDQ3177626FDOQ3177626
Publication date: 1 August 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1466884
Recommendations
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- Some remarks on the Minty vector variational principle
- On generalized approximate convex functions and variational inequalities
- A non-smooth version of Minty variational principle
- Generalized Minty vector variational-like inequalities and vector optimization problems
nonsmooth optimizationvector variational inequalitiesapproximate efficient solutionsgeneralized approximate convexity
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Approximate convexity and submonotonicity.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the generalization of a direct method of the calculus of variations
- Title not available (Why is that?)
- Cutting plane oracles to minimize non-smooth non-convex functions
- \(\epsilon\)-solutions in vector minimization problems
- On vector variational inequalities in reflexive Banach spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- ε-Subdifferential and ε-monotonicity
- Epsilon efficiency
- On approximately star-shaped functions and approximate vector variational inequalities
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity
- Design of a flight control architecture using a non-convex bundle method
- Optimality via generalized approximate convexity and quasiefficiency
- Approximately Efficient Solutions in Vector Optimization
- On approximate starshapedness in multiobjective optimization
- Generalized vector quasi-variational-like inequalities
Cited In (8)
- Generalized Minty vector variational-like inequalities and vector optimization problems
- On minty variational principle for quasidifferentiable vector optimization problems
- Duality for fractional interval-valued optimization problem via convexificator
- On local quasi efficient solutions for nonsmooth vector optimization problems
- On interval-valued vector variational-like inequalities and vector optimization problems with generalized approximate invexity via convexificators
- On variational inequalities using directional convexificators
- A non-smooth version of Minty variational principle
- Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
This page was built for publication: On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177626)
