2013
DOI: 10.1007/s10957-013-0432-3
|View full text |Cite
|
Sign up to set email alerts
|

Local–Global Minimum Property in Unconstrained Minimization Problems

Abstract: The main goal of this paper is to prove some new results and extend some earlier ones about functions, which possess the so called local-global minimum property. In the last section, we show an application of these in the theory of calculus of variations.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…Their use is based on the local-global minimum property (see e.g. [10], [9] and the references therein). More precisely, all local minimizers of the previously listed functions are global minimizers as well.…”
Section: Applications and Special Casesmentioning
confidence: 99%
“…Their use is based on the local-global minimum property (see e.g. [10], [9] and the references therein). More precisely, all local minimizers of the previously listed functions are global minimizers as well.…”
Section: Applications and Special Casesmentioning
confidence: 99%
“…As a byproduct, our function shows that the generalization of quasiconvexity to non-convex domains described in [6, Chapter 9] is a proper subset of global functions. This generalization was proposed in [41] and further investigated in [7,33,34,15,16,17]. It consists in replacing the segment used to define convexity and quasiconvexity by a continuous path.…”
Section: Notion Of Global Functionmentioning
confidence: 99%
“…In general, for nonlinear problems, extrema can be located using first-order conditions, where the first derivative of the objective function is zero or undefined (critical points of a differentiable function). In a non-convex case, second-order conditions can then be used to determine whether the points in the solution space are locally optimal [6]; a matrix of second derivatives (Hessian Matrix) can be used for this purpose [7]. Although not applicable to every type of optimisation problem, KarshKuhn-Tucker conditions can be used to determine the necessary optimality conditions of problems with equality or inequality constraints.…”
Section: Introductionmentioning
confidence: 99%