Informacja

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

Wyszukujesz frazę "gradient projection" wg kryterium: Temat


Wyświetlanie 1-7 z 7
Tytuł:
Iteratively reweighted least squares classifier and its l2- and l1-regularized Kernel versions
Autorzy:
Łęski, J.
Powiązania:
https://bibliotekanauki.pl/articles/199904.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
classifier design
IRLS
conjugate gradient optimization
gradient projection
Kernel matrix
Opis:
This paper introduces a new classifier design method based on regularized iteratively reweighted least squares criterion function. The proposed method uses various approximations of misclassification error, including: linear, sigmoidal, Huber and logarithmic. Using the represented theorem a kernel version of classifier design method is introduced. The conjugate gradient algorithm is used to minimize the proposed criterion function. Furthermore, .1-regularized kernel version of the classifier is introduced. In this case, the gradient projection is used to optimize the criterion function. Finally, an extensive experimental analysis on 14 benchmark datasets is given to demonstrate the validity of the introduced methods.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2010, 58, 1; 171-182
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximate gradient projection method with general Runge-Kutta schemes and piecewise polynomial controls for optimal control problems
Autorzy:
Chryssoverghi, I.
Powiązania:
https://bibliotekanauki.pl/articles/970094.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
dyskretyzacja
sterowanie optymalne
optimal control
gradient projection method
discretization
non-matching Runge-Kutta schemes
piecewise polynomial controls
Opis:
This paper addresses the numerical solution of optimal control problems for systems described by ordinary differential equations with control constraints. The state equation is discretized by a general explicit Runge-Kutta scheme and the controls are approximated by functions that are piecewise polynomial, but not necessarily continuous. We then propose an approximate gradient projection method that constructs sequences of discrete controls and progressively refines the discretization. Instead of using the exact discrete cost derivative, which usually requires tedious calculations, we use here an approximate derivative of the cost functional denned by discretizing the continuous adjoint equation by the same Runge-Kutta scheme backward and the integral involved by a Newton-Cotes integration rule, both involving maximal order intermediate approximations. The main result is that strong accumulation points in L2, if they exist, of sequences generated by this method satisfy the weak necessary conditions for optimality for the continuous problem. In the unconstrained case and under additional assumptions, we prove strong convergence in L2 and derive an a posteriori error estimate. Finally, numerical examples are given.
Źródło:
Control and Cybernetics; 2005, 34, 2; 425-451
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Symmetrized semi-smooth Newton method for solving 3D contact problems
Symetrizovaná nehladká Newtonova metoda pro rešení 3D kontaktních úloh
Autorzy:
Kucera, R.
Haslinger, J.
Motycková, K.
Markopoulos, A.
Powiązania:
https://bibliotekanauki.pl/articles/112650.pdf
Data publikacji:
2017
Wydawca:
STE GROUP
Tematy:
contact problem
Tresca friction
semi-smooth Newton methods
conjugate gradient method
gradient projection
convergence rate
zagadnienie kontaktowe
tarcie Treski
metoda gradientu sprzężonego
rzutowanie gradientu
szybkość konwergencji
Opis:
The semi-smooth Newton method for solving discretized contact problems with Tresca friction in three space dimensions is analyzed. The slanting function is approximated to get symmetric inner linear systems. The primal-dual algorithm is transformed into the dual one so that the conjugate gradient method can be used. The R-linear convergence rate is proved for an inexact globally convergent variant of the method. Numerical experiments conclude the paper. The contact problems are important in many practical applications, e.g., biological processes, design of machines, transportation systems, metal forming, or medicine (bone replacements).
V práci je analyzována nehladká Newtonova metoda pro rešení diskretizovaných kontaktních úloh s Trescovým trením ve trech prostorových dimenzích. Slanting funkce je aproximována za úcelem získání symetrických vnitrních lineárních úloh. Pro použití metody sdružených gradientu je primárne-duální algoritmus preveden na duální. R-lineární rychlost konvergence je dokázána pro nepresnou globálne konvergentní variantu metody. Záverem jsou uvedeny numerické experimenty. Kontaktní úlohy mají radu významných aplikací, napr. biologické procesy, design stroju a prepravních systému, tvárení kovu nebo medicína (modelování kostních náhrad).
Źródło:
Systemy Wspomagania w Inżynierii Produkcji; 2017, 6, 4; 286-293
2391-9361
Pojawia się w:
Systemy Wspomagania w Inżynierii Produkcji
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Searching for optimal prestressing of steel bar structures based on sensitivity analysis
Autorzy:
Yurchenko, V. V.
Peleshko, I. D.
Powiązania:
https://bibliotekanauki.pl/articles/230774.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
optymalizacja parametryczna
element zbędny
siła sprężająca początkowa
sprężenie optymalne
analiza wrażliwości
metoda rzutowania gradientowego
parametric optimization
redundant member
initial prestressing force
optimal prestressing
sensitivity analysis
gradient projection method
Opis:
The paper considers parametric optimization problems for the steel bar structures formulated as nonlinear programming ones with variable unknown cross-sectional sizes of the structural members, as well as initial prestressing forces introduced into the specified redundant members of the structure. The system of constraints covers load-bearing capacity constraints for all the design sections of the structural members subjected to all the design load combinations at ultimate limit state, as well as displacement constraints for the specified nodes of the bar system, subjected to all design load combinations at serviceability limit state. The method of the objective function gradient projection onto the active constraints surface with simultaneous correction of the constraints violations has been used to solve the parametric optimization problem. A numerical technique to determine the optimal number of the redundant members to introduce the initial prestressing forces has been offered for high-order statically indeterminate bar structures. It reduces the dimension for the design variable vector of unknown initial prestressing forces for considered optimization problems.
Źródło:
Archives of Civil Engineering; 2020, 66, 3; 525-540
1230-2945
Pojawia się w:
Archives of Civil Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improvement of design technique of track machines bodies bearing structures
Doskonalenie technologii projektowania układów nośnych korpusów maszyn do obsługi torów kolejowych
Autorzy:
Tovt, B.
Powiązania:
https://bibliotekanauki.pl/articles/374930.pdf
Data publikacji:
2012
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
optymalizacja
procedura numeryczna
rzutowanie gradientu
metoda elementów skończonych
struktura łożyska
korpus
trwałość
optimization
numerical procedure
gradient projection
finite element method
bearing structure
body
durability
deflected mode
track machine
Opis:
The paper is devoted to improvement of design technique of track machines bodies bearing structures. The review and analysis of state-of-the-art of the mathematical programming theory and the optimal designing are done. The numerical optimization procedure for track machines bodies bearing structures is proposed. The approbation of the proposed procedure is taken on structural optimization problems. Mathematical aspects of proposed procedure implementation are investigated, particularly the algorithm convergence and the sensitivity analysis of initial designs. Deflected mode of the ballast leveling machine SPZ-5/UA body bearing structure was investigated analytically (FEM study) and experimentally (trial running inspection on durability). The necessity of optimization implementation for bodies bearing structures is substantiated. The rational design of track machine SPZ-5/UA bearing structure was obtained with the numerical optimization procedure proposed in the paper. The deflected mode of the body rational bearing structure was investigated.
Źródło:
Transport Problems; 2012, 7, 3; 95-107
1896-0596
2300-861X
Pojawia się w:
Transport Problems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a linear-quadratic problem with Caputo derivative
Autorzy:
Idczak, D.
Walczak, S.
Powiązania:
https://bibliotekanauki.pl/articles/254761.pdf
Data publikacji:
2016
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
fractional Caputo derivative
linear quadratic problem
existence and uniqueness of a solution
maximum principle
gradient method
projection of the gradient method
Opis:
In this paper, we study a linear-quadratic optimal control problem with a fractional control system containing a Caputo derivative of unknown function. First, we derive the formulas for the differential and gradient of the cost functional under given constraints. Next, we prove an existence result and derive a maximum principle. Finally, we describe the gradient and projection of the gradient methods for the problem under consideration.
Źródło:
Opuscula Mathematica; 2016, 36, 1; 49-68
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Orthogonal polynomials and the Lanczos method
Autorzy:
Brezinski, C.
Sadok, H.
Redivo Zaglia, M.
Powiązania:
https://bibliotekanauki.pl/articles/1361029.pdf
Data publikacji:
1994
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
projection
biconjugate gradient
orthogonal polynomials
Lanczos method
Opis:
Lanczos method for solving a system of linear equations is well known. It is derived from a generalization of the method of moments and one of its main interests is that it provides the exact answer in at most n steps where n is the dimension of the system. Lanczos method can be implemented via several recursive algorithms known as Orthodir, Orthomin, Orthores, Biconjugate gradient,... In this paper, we show that all these procedures can be explained within the framework of formal orthogonal polynomials. This theory also provides a natural basis for curing breakdown and near-breakdown in these algorithms. The case of the conjugate gradient squared method can be treated similarly.
Źródło:
Banach Center Publications; 1994, 29, 1; 19-33
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-7 z 7

    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