Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 85 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 419 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Set-optimization meets variational inequalities (1303.4212v2)

Published 18 Mar 2013 in math.OC

Abstract: We study necessary and sufficient conditions to attain solutions of set-optimization problems in therms of variational inequalities of Stampacchia and Minty type. The notion of a solution we deal with has been introduced Heyde and Loehne, for convex set-valued objective functions. To define the set-valued variational inequality, we introduce a set-valued directional derivative and we relate it to the Dini derivatives of a family of linearly scalarized problems. The optimality conditions are given by Stampacchia and Minty type Variational inequalities, defined both by the set valued directional derivative and by the Dini derivatives of the scalarizations. The main results allow to obtain known variational characterizations for vector valued optimization problems.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.