2008
DOI: 10.1002/9781118033340
|View full text |Cite
|
Sign up to set email alerts
|

An Introduction to Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
512
0
10

Year Published

2009
2009
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 527 publications
(522 citation statements)
references
References 0 publications
0
512
0
10
Order By: Relevance
“…Complex optimization problems arising from rational choice theory can be solved by mathematical programming, calculus of variations, and similar methods (see, e.g., Kamien and Schwartz, 2012;Chong and Zak, 2013). Optimal decisions under constraints are not only discussed as a description of human behavior, but are also often taken as the normative benchmark for comparison with other nonoptimal approaches that we discuss in Sect.…”
Section: Optimal Decisions and Utility Theory In Rational Choice Modelsmentioning
confidence: 99%
“…Complex optimization problems arising from rational choice theory can be solved by mathematical programming, calculus of variations, and similar methods (see, e.g., Kamien and Schwartz, 2012;Chong and Zak, 2013). Optimal decisions under constraints are not only discussed as a description of human behavior, but are also often taken as the normative benchmark for comparison with other nonoptimal approaches that we discuss in Sect.…”
Section: Optimal Decisions and Utility Theory In Rational Choice Modelsmentioning
confidence: 99%
“…As shown in Figure 5.3the process of this step of algorithm involves different steps to implement the presence of face regions among objects. The process include temperature thresholding, boundary extraction, template matching and Neyman-pearson testing [72,73]. The algorithm will apply on all the simulated images.…”
Section: Applying the Algorithm On Simulated Imagesmentioning
confidence: 99%
“…It is built on the examination that if the real-valued function is steady differentiable in a neighborhood of a point , then will be the direction of steepest variation of [73]. By considering as a scalar valued function we then have:…”
mentioning
confidence: 99%
“…Because the nonlinear constrained optimization problem defined by (21) can be converted to a convex optimization problem, and be efficiently solved by numerical methods, such as Lagrangian algorithm [4], or software solvers, such as MATLAB's Optimization Toolbox, and there exists a unique NE in the auction, we can design an asynchronous iterative bid updating algorithm to achieve NE based on each bidder's local information and the limited feedback received from the gateway. The key idea is to let the gateway help M R…”
Section: Iterative Algorithm To Achieve Nementioning
confidence: 99%