2008
DOI: 10.1007/978-0-387-78723-7
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear Optimization with Engineering Applications

Abstract: Aims and ScopeOptimization has been expanding in all directions at an astonishing rate during the last few decades. New algorithmic and theoretical techniques have been developed, the diffusion into other disciplines has proceeded at a rapid pace, and our knowledge of all aspects of the field has grown even more profound. At the same time, one of the most striking trends in optimization is the constantly increasing emphasis on the interdisciplinary nature of the field. Optimization has been a basic tool in all… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
46
0
3

Year Published

2009
2009
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 100 publications
(49 citation statements)
references
References 39 publications
0
46
0
3
Order By: Relevance
“…It is well-known (see for instance [3]) that the minimum of the exact penalty function (9) coincides with the solution of the original inequality constrained problem provided ρ is chosen sufficiently large.…”
Section: Using ω For Portfolio Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…It is well-known (see for instance [3]) that the minimum of the exact penalty function (9) coincides with the solution of the original inequality constrained problem provided ρ is chosen sufficiently large.…”
Section: Using ω For Portfolio Optimizationmentioning
confidence: 99%
“…(see [3] for instance). Table 4 shows the portfolios obtained by minimizing downside risk DV for the values of R p in Tables 2 and 3.…”
Section: Comparing Maximum ω and Minimum-risk Portfoliosmentioning
confidence: 99%
“…The most popular method discussed in the literature for solving this type of optimisation problem is the Sequential Quadratic Programming method (SQP), see [15,16,17]. It is an iterative method that generates a sequence of quadratic programs to be solved at each iterate.…”
Section: Optimisation Algorithmmentioning
confidence: 99%
“…It ranges from simple everyday decisions to strategic decisions in war. To make decisions easier, a number of methodologies have been developed, including linear and non-linear optimization (Bartholomew-Biggs, 2008;Chang, 2010;Taha, 1971), multiple-criteria decision analysis (MCDA) (Chang, 2010;Figueira et al, 2005;Hipel et al, 1993b), game theory (von Neumann and Morgenstern, 1944), fuzzy decision making (Nakamura, 1986;De Wilde, 2004), and the Graph Model for Conflict Resolution (GMCR) (Fang et al, 1993;Kilgour et al, 1987). Depending on the number of decision makers (DMs) and objectives, decision making techniques are divided into four main categories: (i) single participant-single objective (such as most operations research models), (ii) single participant-multiple objective (such as MCDA methods), (iii) multiple participant-single objective (such as team theory), and (iv) multiple participantmultiple objective (such as GMCR) decision making.…”
Section: Introductionmentioning
confidence: 99%