Namespaces
Variants
Actions

Difference between revisions of "Minimizing sequence for an operator"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
m (tex encoded by computer)
 
Line 1: Line 1:
A sequence of elements <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640201.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640202.png" />, minimizing a continuous functional <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640203.png" />, <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640204.png" />:
+
<!--
 +
m0640201.png
 +
$#A+1 = 23 n = 0
 +
$#C+1 = 23 : ~/encyclopedia/old_files/data/M064/M.0604020 Minimizing sequence for an operator
 +
Automatically converted into TeX, above some diagnostics.
 +
Please remove this comment and the {{TEX|auto}} line below,
 +
if TeX found to be correct.
 +
-->
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640205.png" /></td> </tr></table>
+
{{TEX|auto}}
 +
{{TEX|done}}
  
Minimization problems for functionals are usually divided into two groups. To the first group belong problems of finding the minimal value of a functional, for which it is irrelevant at which element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640206.png" /> the minimum is attained. In this case the values of the functional associated with any minimizing sequence may be used as an approximate solution. The other group of problems concerns the search for an element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640207.png" /> at which the functional <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640208.png" /> attains its least value:
+
A sequence of elements  $  \{ z _ {n} \} $,
 +
$  z _ {n} \in Z $,
 +
minimizing a continuous functional $  I [ z ] $,  
 +
$  z \in Z $:
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m0640209.png" /></td> <td valign="top" style="width:5%;text-align:right;">(1)</td></tr></table>
+
$$
 +
I [ z _ {n} ]  \rightarrow  \inf _ {z \in Z }  I[ z ]
 +
,\  n \rightarrow \infty .
 +
$$
  
In this connection, there are minimizing sequences which do not converge to an element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402010.png" />.
+
Minimization problems for functionals are usually divided into two groups. To the first group belong problems of finding the minimal value of a functional, for which it is irrelevant at which element  $  z $
 +
the minimum is attained. In this case the values of the functional associated with any minimizing sequence may be used as an approximate solution. The other group of problems concerns the search for an element $  z  ^ {*} $
 +
at which the functional  $  I [ z ] $
 +
attains its least value:
  
Let the minimization problem (1) have a unique solution <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402011.png" /> and let <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402012.png" /> be a minimizing sequence, that is, a sequence such that
+
$$ \tag{1 }
 +
\inf _ {z \in Z }  I [ z ]  = I [ z  ^ {*} ]  = I  ^ {*} .
 +
$$
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402013.png" /></td> <td valign="top" style="width:5%;text-align:right;">(2)</td></tr></table>
+
In this connection, there are minimizing sequences which do not converge to an element  $  z  ^ {*} $.
  
The minimization problem (1) is called stable if every minimizing sequence (2) converges to the element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402014.png" />.
+
Let the minimization problem (1) have a unique solution  $  z  ^ {*} $
 +
and let  $  \{ z _ {n} \} $
 +
be a minimizing sequence, that is, a sequence such that
  
In the solution of stable problems a minimizing sequence is obtained by constructing a sequence of iterates so that relative to <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402015.png" /> (the <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402016.png" />-th iterate) a "direction" <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402017.png" /> is found, and an element
+
$$ \tag{2 }
 +
\lim\limits _ {n \rightarrow \infty }  I [ z _ {n} ]  I ^ {*} .
 +
$$
  
<table class="eq" style="width:100%;"> <tr><td valign="top" style="width:94%;text-align:center;"><img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402018.png" /></td> </tr></table>
+
The minimization problem (1) is called stable if every minimizing sequence (2) converges to the element  $  z  ^ {*} \in Z $.
  
is chosen from the set of elements <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402019.png" /> minimizing the function <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402020.png" /> of the variable <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402021.png" />.
+
In the solution of stable problems a minimizing sequence is obtained by constructing a sequence of iterates so that relative to  $  z _ {n} $(
 +
the  $  n $-
 +
th iterate) a  "direction"  $  y _ {n} $
 +
is found, and an element
 +
 
 +
$$
 +
z _ {n+} 1  =  z _ {n} - f ( \rho _ {n} ) y _ {n}  $$
 +
 
 +
is chosen from the set of elements $  z _ {n} - f ( \rho ) y _ {n} $
 +
minimizing the function $  I [ z _ {n} - f ( \rho ) y _ {n} ] $
 +
of the variable $  \rho $.
  
 
Methods for constructing minimizing sequences for stable problems (1) are divided into three families. In the first, derivatives are not used; these are the direct methods. The second family uses the first derivatives of the functional; these methods are usually called descent methods. The third group of methods consists of algorithms which use second derivatives of the functional.
 
Methods for constructing minimizing sequences for stable problems (1) are divided into three families. In the first, derivatives are not used; these are the direct methods. The second family uses the first derivatives of the functional; these methods are usually called descent methods. The third group of methods consists of algorithms which use second derivatives of the functional.
  
In non-stable minimization problems for functionals, regularization methods are applied to construct a sequence <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402022.png" /> converging to the element <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/m/m064/m064020/m06402023.png" />.
+
In non-stable minimization problems for functionals, regularization methods are applied to construct a sequence $  \{ z _ {n} \} $
 +
converging to the element $  z  ^ {*} $.
  
 
====References====
 
====References====
 
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  A.N. Tikhonov,  V.I. [V.I. Arsenin] Arsenine,  "Solution of ill-posed problems" , Winston  (1977)  (Translated from Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  J. Céa,  "Optimisation. Théorie et algorithmes" , Dunod  (1971)</TD></TR></table>
 
<table><TR><TD valign="top">[1]</TD> <TD valign="top">  A.N. Tikhonov,  V.I. [V.I. Arsenin] Arsenine,  "Solution of ill-posed problems" , Winston  (1977)  (Translated from Russian)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top">  J. Céa,  "Optimisation. Théorie et algorithmes" , Dunod  (1971)</TD></TR></table>

Latest revision as of 08:00, 6 June 2020


A sequence of elements $ \{ z _ {n} \} $, $ z _ {n} \in Z $, minimizing a continuous functional $ I [ z ] $, $ z \in Z $:

$$ I [ z _ {n} ] \rightarrow \inf _ {z \in Z } I[ z ] ,\ n \rightarrow \infty . $$

Minimization problems for functionals are usually divided into two groups. To the first group belong problems of finding the minimal value of a functional, for which it is irrelevant at which element $ z $ the minimum is attained. In this case the values of the functional associated with any minimizing sequence may be used as an approximate solution. The other group of problems concerns the search for an element $ z ^ {*} $ at which the functional $ I [ z ] $ attains its least value:

$$ \tag{1 } \inf _ {z \in Z } I [ z ] = I [ z ^ {*} ] = I ^ {*} . $$

In this connection, there are minimizing sequences which do not converge to an element $ z ^ {*} $.

Let the minimization problem (1) have a unique solution $ z ^ {*} $ and let $ \{ z _ {n} \} $ be a minimizing sequence, that is, a sequence such that

$$ \tag{2 } \lim\limits _ {n \rightarrow \infty } I [ z _ {n} ] = I ^ {*} . $$

The minimization problem (1) is called stable if every minimizing sequence (2) converges to the element $ z ^ {*} \in Z $.

In the solution of stable problems a minimizing sequence is obtained by constructing a sequence of iterates so that relative to $ z _ {n} $( the $ n $- th iterate) a "direction" $ y _ {n} $ is found, and an element

$$ z _ {n+} 1 = z _ {n} - f ( \rho _ {n} ) y _ {n} $$

is chosen from the set of elements $ z _ {n} - f ( \rho ) y _ {n} $ minimizing the function $ I [ z _ {n} - f ( \rho ) y _ {n} ] $ of the variable $ \rho $.

Methods for constructing minimizing sequences for stable problems (1) are divided into three families. In the first, derivatives are not used; these are the direct methods. The second family uses the first derivatives of the functional; these methods are usually called descent methods. The third group of methods consists of algorithms which use second derivatives of the functional.

In non-stable minimization problems for functionals, regularization methods are applied to construct a sequence $ \{ z _ {n} \} $ converging to the element $ z ^ {*} $.

References

[1] A.N. Tikhonov, V.I. [V.I. Arsenin] Arsenine, "Solution of ill-posed problems" , Winston (1977) (Translated from Russian)
[2] J. Céa, "Optimisation. Théorie et algorithmes" , Dunod (1971)
How to Cite This Entry:
Minimizing sequence for an operator. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Minimizing_sequence_for_an_operator&oldid=47851
This article was adapted from an original article by Yu.V. Rakitskii (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article