2008
DOI: 10.1137/1.9780898718614
|View full text |Cite
|
Sign up to set email alerts
|

Lagrange Multiplier Approach to Variational Problems and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
525
0
1

Year Published

2010
2010
2018
2018

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 497 publications
(528 citation statements)
references
References 0 publications
2
525
0
1
Order By: Relevance
“…According to the superlinear convergence theorem for Newton differentiable mappings [13,14] it suffices to verify that the inverses of the generalized gradients G F (y, u, p) are uniformly bounded in a neighborhood of (y c , u c , p c ), which was achieved in Lemma 4. Combining the results of Section 3.1 and this section we showed that the solutions of the regularized problem (P c ) converge in the sense of Proposition 3.8 and that each regularized problem with a fixed value of c can be solved with superlinear rate.…”
Section: Semi-smooth Newton Method: Wellposedness and Convergencementioning
confidence: 99%
See 1 more Smart Citation
“…According to the superlinear convergence theorem for Newton differentiable mappings [13,14] it suffices to verify that the inverses of the generalized gradients G F (y, u, p) are uniformly bounded in a neighborhood of (y c , u c , p c ), which was achieved in Lemma 4. Combining the results of Section 3.1 and this section we showed that the solutions of the regularized problem (P c ) converge in the sense of Proposition 3.8 and that each regularized problem with a fixed value of c can be solved with superlinear rate.…”
Section: Semi-smooth Newton Method: Wellposedness and Convergencementioning
confidence: 99%
“…Solving (1.7) numerically by Newton-type methods is impeded by the lack of C 1 regularity of the sgn c operator. In Section 4 it will be shown that semi-smooth Newton methods are applicable to (1.7) [14]. This requires the verification of Newton differentiability, which is quite standard by now, as well as well-posedness of the Newton-step and uniform boundedness of the inverse of the generalized derivatives, which is more delicate to verify.…”
Section: Introduction Problem Statement Regularizationmentioning
confidence: 99%
“…Various types of methods exist in the literature and, in this paper, we choose two of them which have proved to be efficient for such problems (see e.g. [27]), namely the Augmented Lagrangian method and the Bermúdez-Moreno method. Their definitions and derivations are different, but interestingly the obtained structure of the algorithms is the same.…”
Section: Treating the Velocity Inequality With Two Duality Methodsmentioning
confidence: 99%
“…In the context of infinite dimensional problems, a lot of effort has been put into developing efficient numerical schemes for the solution of quadratic minimization problems bound to side constraints, see e.g., [15,16] and the references therein. Since it is known that the system of equations of the penalized discrete problem becomes ill-conditioned as ε → 0, it is natural to ask for other, more robust methods for specific applications.…”
Section: Minimization Problem (M)mentioning
confidence: 99%