Application of the method of contractor directions to the Dubovitskii- Milyutin formalism (Q1096878): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractor directions, directional contractors and directional contractions for solving equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the method of contractor directions to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some specification of the Dubovitskii-Milyutin method / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-247x(87)90172-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2074318673 / rank
 
Normal rank

Latest revision as of 08:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Application of the method of contractor directions to the Dubovitskii- Milyutin formalism
scientific article

    Statements

    Application of the method of contractor directions to the Dubovitskii- Milyutin formalism (English)
    0 references
    1987
    0 references
    The method of contractor directions obtained by \textit{M. Altman} [see, e.g., Contructors and contractor directions. Theory and applications (Lect. Notes Pure Appl. Math. 32) (1977; Zbl 0363.65045)] is applied to optimization. A general optimization problem in Banach spaces has been discussed: minimize the functional G(x) under the constraints \(x_ i\in Z_ i\), \(i=n+1...n+m\); where \(Z_ i\), \(i=1,2...n\), are inequality constraints, \(Z_ j\), \(j=n+1...n+m\) are given in the form \(Z_ j=\{x\in X:\) \(F_ j(x)=0\}\) where \(F_ j: X\to Y_ j\), \(j=n+1...n+m\), are Gâteaux differentiable operators. By using the method of contractor directions, the tangent directions to the einimal solutions without self-intersections of this problem have a uniquely determined ``slope'' \(\alpha \in R^ n\). For irrational \(\alpha\) these minimal solutions are obtained as limits of minimal solutions with rational slope. The author describes a new approach to the basic invariant, the slope of a minimal solution without selfintersections, and shows that for every \(\alpha \in R^ n\setminus Q^ n\) the limit set of minimal solutions is essentially unique.
    0 references
    method of contractor directions
    0 references
    optimization problem in Banach spaces
    0 references
    Gâteaux differentiable operators
    0 references
    tangent directions
    0 references
    slope
    0 references
    limit set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references