Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "projection" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-9 z 9
    Tytuł:
    Projection method with residual selection for linear feasibility problems
    Autorzy:
    Dylewski, Robert
    Powiązania:
    https://bibliotekanauki.pl/articles/729437.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    projection method
    linear feasibility
    residual selection
    Opis:
    We propose a new projection method for linear feasibility problems. The method is based on the so called residual selection model. We present numerical results for some test problems.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2007, 27, 1; 43-50
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Partial covers of graphs
    Autorzy:
    Fiala, Jirí
    Kratochvíl, Jan
    Powiązania:
    https://bibliotekanauki.pl/articles/743545.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    covering projection
    computational complexity
    graph homomorphism
    Opis:
    Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for every edge (u,v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a practical problem of assigning frequencies to transmitters without interference. We compare the problems of deciding existence of partial covers and of full covers (locally bijective homomorphisms), which were previously studied.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2002, 22, 1; 89-99
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Projection method with level control in convex minimization
    Autorzy:
    Dylewski, Robert
    Powiązania:
    https://bibliotekanauki.pl/articles/729283.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    projection method
    convex nondifferentiable minimization
    level control
    Opis:
    We study a projection method with level control for nonsmoooth convex minimization problems. We introduce a changeable level parameter to level control. The level estimates the minimal value of the objective function and is updated in each iteration. We analyse the convergence and estimate the efficiency of this method.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2010, 30, 1; 101-120
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Large-scale nonlinear programming algorithm using projection methods
    Autorzy:
    Białoń, Paweł
    Powiązania:
    https://bibliotekanauki.pl/articles/729340.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    nonlinear optimization
    large scale optimization
    projection methods
    zigzagging
    Opis:
    A method for solving large convex optimization problems is presented. Such problems usually contain a big linear part and only a small or medium nonlinear part. The parts are tackled using two specialized (and thus efficient) external solvers: purely nonlinear and large-scale linear with a quadratic goal function. The decomposition uses an alteration of projection methods. The construction of the method is based on the zigzagging phenomenon and yields a non-asymptotic convergence, not dependent on a large dimension of the problem. The method preserves its convergence properties under limitations in complicating sets by geometric cuts. Various aspects and variants of the method are analyzed theoretically and experimentally.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 171-194
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Properties of projection and penalty methods for discretized elliptic control problems
    Autorzy:
    Cegielski, Andrzej
    Grossmann, Christian
    Powiązania:
    https://bibliotekanauki.pl/articles/729435.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    convex programming
    control of PDE
    projection methods
    penalty methods
    Opis:
    In this paper, properties of projection and penalty methods are studied in connection with control problems and their discretizations. In particular, the convergence of an interior-exterior penalty method applied to simple state constraints as well as the contraction behavior of projection mappings are analyzed. In this study, the focus is on the application of these methods to discretized control problem.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2007, 27, 1; 23-41
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
    Autorzy:
    Dylewski, Robert
    Powiązania:
    https://bibliotekanauki.pl/articles/729267.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    convex nondifferentiable minimization
    projection method
    subgradient method
    acute cone
    obtuse cone
    Opis:
    We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent system of subgradients. The next approximation of a solution is the projection onto a translated acute cone which is dual to the constructed obtuse cone. The target value which estimates the minimal objective value is updated in each iteration. The numerical tests for some tests problems are presented in which the method of Cegielski [1] is compared with the method of Kim, Ahn and Cho [2].
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 147-158
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Selection strategies in projection methods for convex minimization problems
    Autorzy:
    Cegielski, Andrzej
    Dylewski, Robert
    Powiązania:
    https://bibliotekanauki.pl/articles/729560.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    convex minimization
    projection method
    long steps
    residual selection
    obtuse cone selection
    Opis:
    We propose new projection method for nonsmooth convex minimization problems. We present some method of subgradient selection, which is based on the so called residual selection model and is a generalization of the so called obtuse cone model. We also present numerical results for some test problems and compare these results with some other convex nonsmooth minimization methods. The numerical results show that the presented selection strategies ensure long steps and lead to an essential acceleration of the convergence of projection methods.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 1; 97-123
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Signal reconstruction from given phase of the Fourier transform using Fejér monotone methods
    Autorzy:
    Schott, Dieter
    Powiązania:
    https://bibliotekanauki.pl/articles/729265.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    signal reconstruction
    convex feasibility problem
    projection onto convex sets
    Fejér monotone iterative methods
    Fourier transforms
    Opis:
    The aim is to reconstruct a signal function x ∈ L₂ if the phase of the Fourier transform [x̂] and some additional a-priori information of convex type are known. The problem can be described as a convex feasibility problem. We solve this problem by different Fejér monotone iterative methods comparing the results and discussing the choice of relaxation parameters. Since the a-priori information is partly related to the spectral space the Fourier transform and its inverse have to be applied in each iterative step numerically realized by FFT techniques. The computation uses MATLAB routines.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 1; 27-40
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Best approximations, fixed points and parametric projections
    Autorzy:
    Cardinali, Tiziana
    Powiązania:
    https://bibliotekanauki.pl/articles/729491.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    fixed point
    parametric projection
    best approximation
    upper semicontinuous
    partially closed graph
    f-approximatively compact
    Oshman space
    Opis:
    If f is a continuous seminorm, we prove two f-best approximation theorems for functions Φ not necessarily continuous as a consequence of our version of Glebov's fixed point theorem. Moreover, we obtain another fixed point theorem that improves a recent result of [4]. In the last section, we study continuity-type properties of set valued parametric projections and our results improve recent theorems due to Mabizela [11].
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 2; 243-260
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-9 z 9

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies