In many practical applications, the objective function is convex. The use of convex objective functions makes optimization easier, but ubiquity of such objective function is a mystery: many practical optimization problems are not easy to solve, so it is not clear why the objective function -- whose main goal is to describe our needs -- would always describe easier-to-achieve goals. In this paper, we explain this ubiquity based on the fundamental ideas about human decision making. This explanation also helps us explain why in decision making under uncertainty, people often make pessimistic decisions, i.e.., decisions based on the worst-case scenarios
The question we address is how robust solutions react to changes in the uncertainty set. We prove th...
In the paper a new approach to goal programming is presented: the robust approach, applied so far to...
Robust Optimization has traditionally taken a pessimistic, or worst-case viewpoint of uncertainty wh...
In many practical applications, the objective function is convex. The use of convex objective functi...
Convex optimization has revolutionized the way problems are thought, posed, and solved in many diffe...
Optimization is the art of finding the best among several alternatives in decision making. Let S ...
International audienceThe study of optimization algorithms started at the end of World War II and ha...
Abstract—After Zadeh and Bellman explained how to optimize a function under fuzzy constraints, there...
Human computation or crowdsourcing involves joint inference of the ground-truth-answers and the wor...
This chapter aims to address some of the fundamental issues that are often encountered in optimizati...
Abstract. Optimization is a procedure of finding and comparing feasible solutions until no better so...
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and pra...
Starting from well-known studies by Kahmenan and Tversky, researchers have found many examples when ...
[eng] One of the most importants problems has been tominimize functions. The history of optimization...
Starting from well-known studies by Kahmenan and Tversky, researchers have found many examples when ...
The question we address is how robust solutions react to changes in the uncertainty set. We prove th...
In the paper a new approach to goal programming is presented: the robust approach, applied so far to...
Robust Optimization has traditionally taken a pessimistic, or worst-case viewpoint of uncertainty wh...
In many practical applications, the objective function is convex. The use of convex objective functi...
Convex optimization has revolutionized the way problems are thought, posed, and solved in many diffe...
Optimization is the art of finding the best among several alternatives in decision making. Let S ...
International audienceThe study of optimization algorithms started at the end of World War II and ha...
Abstract—After Zadeh and Bellman explained how to optimize a function under fuzzy constraints, there...
Human computation or crowdsourcing involves joint inference of the ground-truth-answers and the wor...
This chapter aims to address some of the fundamental issues that are often encountered in optimizati...
Abstract. Optimization is a procedure of finding and comparing feasible solutions until no better so...
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and pra...
Starting from well-known studies by Kahmenan and Tversky, researchers have found many examples when ...
[eng] One of the most importants problems has been tominimize functions. The history of optimization...
Starting from well-known studies by Kahmenan and Tversky, researchers have found many examples when ...
The question we address is how robust solutions react to changes in the uncertainty set. We prove th...
In the paper a new approach to goal programming is presented: the robust approach, applied so far to...
Robust Optimization has traditionally taken a pessimistic, or worst-case viewpoint of uncertainty wh...