Traces and Emergence of Nonlinear Programming 2013
DOI: 10.1007/978-3-0348-0439-4_11
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
223
1
3

Year Published

2014
2014
2019
2019

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 305 publications
(248 citation statements)
references
References 0 publications
1
223
1
3
Order By: Relevance
“…These two conditions were effectively combined by Hertz [64] and Signorini [122], together with the gap-contact alternative: either g > 0 and p = 0, or g = 0 and p 0 if there is contact. The complementarity condition g · p = 0, which enforces this alternative, was explicitly added by Moreau [86], probably inspired by the introduction of such a condition by Kuhn and Tucker [73] in optimization (independently of the thesis of Karush [71], which remained unnoticed until Kuhn and Tucker [73]). Therefore, although the three unilateral contact conditions are usually called Signorini's conditions, it seems fair to attribute them to Hertz, Signorini and Moreau in trio.…”
Section: Summary Of the Main Resultsmentioning
confidence: 99%
“…These two conditions were effectively combined by Hertz [64] and Signorini [122], together with the gap-contact alternative: either g > 0 and p = 0, or g = 0 and p 0 if there is contact. The complementarity condition g · p = 0, which enforces this alternative, was explicitly added by Moreau [86], probably inspired by the introduction of such a condition by Kuhn and Tucker [73] in optimization (independently of the thesis of Karush [71], which remained unnoticed until Kuhn and Tucker [73]). Therefore, although the three unilateral contact conditions are usually called Signorini's conditions, it seems fair to attribute them to Hertz, Signorini and Moreau in trio.…”
Section: Summary Of the Main Resultsmentioning
confidence: 99%
“…And, last but not least, the solutions dominate all others. The latter advantage can be fortified by evaluating the well known optimality criteria given by the Karush-Kuhn-Tucker (KKT) conditions (Kuhn and Tucker 1951). Such that the KKT can be plotted for all derived solutions p of Figs.…”
Section: Contrasting the Gradient-based Multi-criteria Optimization Wmentioning
confidence: 99%
“…The high capacity and high speed computers have made it possible to develop new methods and to apply the optimum calculation for different problems. A method was developed by Kuhn and Tucker for solving the problem (1) with inequality constraints in 1951 [8]. The method was widely used from the 60-es.…”
Section: Nonlinear Programingmentioning
confidence: 99%